YES 102.715
H-Termination proof of /home/matraf/haskell/eval_FullyBlown_Fast/FiniteMap.hs
H-Termination of the given Haskell-Program with start terms could successfully be proven:
↳ HASKELL
↳ LR
mainModule FiniteMap
|
| ((delFromFM :: FiniteMap Int a -> Int -> FiniteMap Int a) :: FiniteMap Int a -> Int -> FiniteMap Int a) |
module FiniteMap where
| | import qualified Maybe
import qualified Prelude
|
| | data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a)
|
| | instance (Eq a, Eq b) => Eq (FiniteMap b a) where
|
| | delFromFM :: Ord a => FiniteMap a b -> a -> FiniteMap a b
| delFromFM | EmptyFM del_key | = | emptyFM |
| delFromFM | (Branch key elt size fm_l fm_r) del_key | |
| | | del_key > key | = |
| mkBalBranch key elt fm_l (delFromFM fm_r del_key) |
|
| | | del_key < key | = |
| mkBalBranch key elt (delFromFM fm_l del_key) fm_r |
|
| | | key == del_key | = |
|
|
|
| | deleteMax :: Ord a => FiniteMap a b -> FiniteMap a b
| deleteMax | (Branch key elt _ fm_l EmptyFM) | = | fm_l |
| deleteMax | (Branch key elt _ fm_l fm_r) | = | mkBalBranch key elt fm_l (deleteMax fm_r) |
|
| | deleteMin :: Ord a => FiniteMap a b -> FiniteMap a b
| deleteMin | (Branch key elt _ EmptyFM fm_r) | = | fm_r |
| deleteMin | (Branch key elt _ fm_l fm_r) | = | mkBalBranch key elt (deleteMin fm_l) fm_r |
|
| | emptyFM :: FiniteMap a b
|
| | findMax :: FiniteMap b a -> (b,a)
| findMax | (Branch key elt _ _ EmptyFM) | = | (key,elt) |
| findMax | (Branch key elt _ _ fm_r) | = | findMax fm_r |
|
| | findMin :: FiniteMap a b -> (a,b)
| findMin | (Branch key elt _ EmptyFM _) | = | (key,elt) |
| findMin | (Branch key elt _ fm_l _) | = | findMin fm_l |
|
| | glueBal :: Ord b => FiniteMap b a -> FiniteMap b a -> FiniteMap b a
| glueBal | EmptyFM fm2 | = | fm2 |
| glueBal | fm1 EmptyFM | = | fm1 |
| glueBal | fm1 fm2 | |
| | | sizeFM fm2 > sizeFM fm1 | = |
| mkBalBranch mid_key2 mid_elt2 fm1 (deleteMin fm2) |
|
| | | otherwise | = |
| mkBalBranch mid_key1 mid_elt1 (deleteMax fm1) fm2 | where |
| mid_elt1 | | = | (\(_,mid_elt1) ->mid_elt1) vv2 |
|
| mid_elt2 | | = | (\(_,mid_elt2) ->mid_elt2) vv3 |
|
| mid_key1 | | = | (\(mid_key1,_) ->mid_key1) vv2 |
|
| mid_key2 | | = | (\(mid_key2,_) ->mid_key2) vv3 |
|
|
|
|
|
|
|
|
|
| | mkBalBranch :: Ord b => b -> a -> FiniteMap b a -> FiniteMap b a -> FiniteMap b a
| mkBalBranch | key elt fm_L fm_R | |
| | | size_l + size_r < 2 | = |
| mkBranch 1 key elt fm_L fm_R |
|
| | | size_r > sIZE_RATIO * size_l | = |
| case | fm_R of |
|
| Branch _ _ _ fm_rl fm_rr | |
| | | sizeFM fm_rl < 2 * sizeFM fm_rr | -> |
|
| | | otherwise | -> |
|
|
|
|
| | | size_l > sIZE_RATIO * size_r | = |
| case | fm_L of |
|
| Branch _ _ _ fm_ll fm_lr | |
| | | sizeFM fm_lr < 2 * sizeFM fm_ll | -> |
|
| | | otherwise | -> |
|
|
|
|
| | | otherwise | = |
| mkBranch 2 key elt fm_L fm_R | where |
| double_L | fm_l (Branch key_r elt_r _ (Branch key_rl elt_rl _ fm_rll fm_rlr) fm_rr) | = | mkBranch 5 key_rl elt_rl (mkBranch 6 key elt fm_l fm_rll) (mkBranch 7 key_r elt_r fm_rlr fm_rr) |
|
| double_R | (Branch key_l elt_l _ fm_ll (Branch key_lr elt_lr _ fm_lrl fm_lrr)) fm_r | = | mkBranch 10 key_lr elt_lr (mkBranch 11 key_l elt_l fm_ll fm_lrl) (mkBranch 12 key elt fm_lrr fm_r) |
|
| single_L | fm_l (Branch key_r elt_r _ fm_rl fm_rr) | = | mkBranch 3 key_r elt_r (mkBranch 4 key elt fm_l fm_rl) fm_rr |
|
| single_R | (Branch key_l elt_l _ fm_ll fm_lr) fm_r | = | mkBranch 8 key_l elt_l fm_ll (mkBranch 9 key elt fm_lr fm_r) |
|
|
|
|
|
|
|
|
|
| | mkBranch :: Ord a => Int -> a -> b -> FiniteMap a b -> FiniteMap a b -> FiniteMap a b
| mkBranch | which key elt fm_l fm_r | = |
| let |
| result | | = | Branch key elt (unbox (1 + left_size + right_size)) fm_l fm_r |
|
|
| in | result |
| where |
|
|
| left_ok | | = |
| case | fm_l of |
|
| EmptyFM | -> | True |
|
| Branch left_key _ _ _ _ | -> |
| let |
| biggest_left_key | | = | fst (findMax fm_l) |
|
|
| in | biggest_left_key < key |
|
|
|
|
|
| right_ok | | = |
| case | fm_r of |
|
| EmptyFM | -> | True |
|
| Branch right_key _ _ _ _ | -> |
| let |
| smallest_right_key | | = | fst (findMin fm_r) |
|
|
| in | key < smallest_right_key |
|
|
|
|
|
unbox :: Int -> Int
|
|
|
|
| | sIZE_RATIO :: Int
|
| | sizeFM :: FiniteMap a b -> Int
| sizeFM | EmptyFM | = | 0 |
| sizeFM | (Branch _ _ size _ _) | = | size |
|
module Maybe where
| | import qualified FiniteMap
import qualified Prelude
|
Lambda Reductions:
The following Lambda expression
\(mid_key1,_)→mid_key1
is transformed to
| mid_key10 | (mid_key1,_) | = mid_key1 |
The following Lambda expression
\(_,mid_elt1)→mid_elt1
is transformed to
| mid_elt10 | (_,mid_elt1) | = mid_elt1 |
The following Lambda expression
\(mid_key2,_)→mid_key2
is transformed to
| mid_key20 | (mid_key2,_) | = mid_key2 |
The following Lambda expression
\(_,mid_elt2)→mid_elt2
is transformed to
| mid_elt20 | (_,mid_elt2) | = mid_elt2 |
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
mainModule FiniteMap
|
| ((delFromFM :: FiniteMap Int a -> Int -> FiniteMap Int a) :: FiniteMap Int a -> Int -> FiniteMap Int a) |
module FiniteMap where
| | import qualified Maybe
import qualified Prelude
|
| | data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a)
|
| | instance (Eq a, Eq b) => Eq (FiniteMap b a) where
|
| | delFromFM :: Ord a => FiniteMap a b -> a -> FiniteMap a b
| delFromFM | EmptyFM del_key | = | emptyFM |
| delFromFM | (Branch key elt size fm_l fm_r) del_key | |
| | | del_key > key | = |
| mkBalBranch key elt fm_l (delFromFM fm_r del_key) |
|
| | | del_key < key | = |
| mkBalBranch key elt (delFromFM fm_l del_key) fm_r |
|
| | | key == del_key | = |
|
|
|
| | deleteMax :: Ord a => FiniteMap a b -> FiniteMap a b
| deleteMax | (Branch key elt _ fm_l EmptyFM) | = | fm_l |
| deleteMax | (Branch key elt _ fm_l fm_r) | = | mkBalBranch key elt fm_l (deleteMax fm_r) |
|
| | deleteMin :: Ord a => FiniteMap a b -> FiniteMap a b
| deleteMin | (Branch key elt _ EmptyFM fm_r) | = | fm_r |
| deleteMin | (Branch key elt _ fm_l fm_r) | = | mkBalBranch key elt (deleteMin fm_l) fm_r |
|
| | emptyFM :: FiniteMap a b
|
| | findMax :: FiniteMap b a -> (b,a)
| findMax | (Branch key elt _ _ EmptyFM) | = | (key,elt) |
| findMax | (Branch key elt _ _ fm_r) | = | findMax fm_r |
|
| | findMin :: FiniteMap b a -> (b,a)
| findMin | (Branch key elt _ EmptyFM _) | = | (key,elt) |
| findMin | (Branch key elt _ fm_l _) | = | findMin fm_l |
|
| | glueBal :: Ord a => FiniteMap a b -> FiniteMap a b -> FiniteMap a b
| glueBal | EmptyFM fm2 | = | fm2 |
| glueBal | fm1 EmptyFM | = | fm1 |
| glueBal | fm1 fm2 | |
| | | sizeFM fm2 > sizeFM fm1 | = |
| mkBalBranch mid_key2 mid_elt2 fm1 (deleteMin fm2) |
|
| | | otherwise | = |
| mkBalBranch mid_key1 mid_elt1 (deleteMax fm1) fm2 | where |
|
|
| mid_elt10 | (_,mid_elt1) | = | mid_elt1 |
|
|
|
| mid_elt20 | (_,mid_elt2) | = | mid_elt2 |
|
|
|
| mid_key10 | (mid_key1,_) | = | mid_key1 |
|
|
|
| mid_key20 | (mid_key2,_) | = | mid_key2 |
|
|
|
|
|
|
|
|
|
| | mkBalBranch :: Ord b => b -> a -> FiniteMap b a -> FiniteMap b a -> FiniteMap b a
| mkBalBranch | key elt fm_L fm_R | |
| | | size_l + size_r < 2 | = |
| mkBranch 1 key elt fm_L fm_R |
|
| | | size_r > sIZE_RATIO * size_l | = |
| case | fm_R of |
|
| Branch _ _ _ fm_rl fm_rr | |
| | | sizeFM fm_rl < 2 * sizeFM fm_rr | -> |
|
| | | otherwise | -> |
|
|
|
|
| | | size_l > sIZE_RATIO * size_r | = |
| case | fm_L of |
|
| Branch _ _ _ fm_ll fm_lr | |
| | | sizeFM fm_lr < 2 * sizeFM fm_ll | -> |
|
| | | otherwise | -> |
|
|
|
|
| | | otherwise | = |
| mkBranch 2 key elt fm_L fm_R | where |
| double_L | fm_l (Branch key_r elt_r _ (Branch key_rl elt_rl _ fm_rll fm_rlr) fm_rr) | = | mkBranch 5 key_rl elt_rl (mkBranch 6 key elt fm_l fm_rll) (mkBranch 7 key_r elt_r fm_rlr fm_rr) |
|
| double_R | (Branch key_l elt_l _ fm_ll (Branch key_lr elt_lr _ fm_lrl fm_lrr)) fm_r | = | mkBranch 10 key_lr elt_lr (mkBranch 11 key_l elt_l fm_ll fm_lrl) (mkBranch 12 key elt fm_lrr fm_r) |
|
| single_L | fm_l (Branch key_r elt_r _ fm_rl fm_rr) | = | mkBranch 3 key_r elt_r (mkBranch 4 key elt fm_l fm_rl) fm_rr |
|
| single_R | (Branch key_l elt_l _ fm_ll fm_lr) fm_r | = | mkBranch 8 key_l elt_l fm_ll (mkBranch 9 key elt fm_lr fm_r) |
|
|
|
|
|
|
|
|
|
| | mkBranch :: Ord b => Int -> b -> a -> FiniteMap b a -> FiniteMap b a -> FiniteMap b a
| mkBranch | which key elt fm_l fm_r | = |
| let |
| result | | = | Branch key elt (unbox (1 + left_size + right_size)) fm_l fm_r |
|
|
| in | result |
| where |
|
|
| left_ok | | = |
| case | fm_l of |
|
| EmptyFM | -> | True |
|
| Branch left_key _ _ _ _ | -> |
| let |
| biggest_left_key | | = | fst (findMax fm_l) |
|
|
| in | biggest_left_key < key |
|
|
|
|
|
| right_ok | | = |
| case | fm_r of |
|
| EmptyFM | -> | True |
|
| Branch right_key _ _ _ _ | -> |
| let |
| smallest_right_key | | = | fst (findMin fm_r) |
|
|
| in | key < smallest_right_key |
|
|
|
|
|
unbox :: Int -> Int
|
|
|
|
| | sIZE_RATIO :: Int
|
| | sizeFM :: FiniteMap b a -> Int
| sizeFM | EmptyFM | = | 0 |
| sizeFM | (Branch _ _ size _ _) | = | size |
|
module Maybe where
| | import qualified FiniteMap
import qualified Prelude
|
Case Reductions:
The following Case expression
| case | fm_l of |
| | EmptyFM | → True |
| | Branch left_key _ _ _ _ | →
| let |
| biggest_left_key | | = fst (findMax fm_l) |
|
in | biggest_left_key < key |
|
is transformed to
| left_ok0 | fm_l key EmptyFM | = True |
| left_ok0 | fm_l key (Branch left_key _ _ _ _) | =
| let |
| biggest_left_key | | = fst (findMax fm_l) |
|
in | biggest_left_key < key |
|
The following Case expression
| case | fm_r of |
| | EmptyFM | → True |
| | Branch right_key _ _ _ _ | →
| let |
| smallest_right_key | | = fst (findMin fm_r) |
|
in | key < smallest_right_key |
|
is transformed to
| right_ok0 | fm_r key EmptyFM | = True |
| right_ok0 | fm_r key (Branch right_key _ _ _ _) | =
| let |
| smallest_right_key | | = fst (findMin fm_r) |
|
in | key < smallest_right_key |
|
The following Case expression
| case | fm_R of |
| | Branch _ _ _ fm_rl fm_rr |
| | | sizeFM fm_rl < 2 * sizeFM fm_rr | |
| | | otherwise | |
|
is transformed to
| mkBalBranch0 | fm_L fm_R (Branch _ _ _ fm_rl fm_rr) |
| | | sizeFM fm_rl < 2 * sizeFM fm_rr | |
| | | otherwise | |
|
The following Case expression
| case | fm_L of |
| | Branch _ _ _ fm_ll fm_lr |
| | | sizeFM fm_lr < 2 * sizeFM fm_ll | |
| | | otherwise | |
|
is transformed to
| mkBalBranch1 | fm_L fm_R (Branch _ _ _ fm_ll fm_lr) |
| | | sizeFM fm_lr < 2 * sizeFM fm_ll | |
| | | otherwise | |
|
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
mainModule FiniteMap
|
| ((delFromFM :: FiniteMap Int a -> Int -> FiniteMap Int a) :: FiniteMap Int a -> Int -> FiniteMap Int a) |
module FiniteMap where
| | import qualified Maybe
import qualified Prelude
|
| | data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a)
|
| | instance (Eq a, Eq b) => Eq (FiniteMap a b) where
|
| | delFromFM :: Ord a => FiniteMap a b -> a -> FiniteMap a b
| delFromFM | EmptyFM del_key | = | emptyFM |
| delFromFM | (Branch key elt size fm_l fm_r) del_key | |
| | | del_key > key | = |
| mkBalBranch key elt fm_l (delFromFM fm_r del_key) |
|
| | | del_key < key | = |
| mkBalBranch key elt (delFromFM fm_l del_key) fm_r |
|
| | | key == del_key | = |
|
|
|
| | deleteMax :: Ord b => FiniteMap b a -> FiniteMap b a
| deleteMax | (Branch key elt _ fm_l EmptyFM) | = | fm_l |
| deleteMax | (Branch key elt _ fm_l fm_r) | = | mkBalBranch key elt fm_l (deleteMax fm_r) |
|
| | deleteMin :: Ord a => FiniteMap a b -> FiniteMap a b
| deleteMin | (Branch key elt _ EmptyFM fm_r) | = | fm_r |
| deleteMin | (Branch key elt _ fm_l fm_r) | = | mkBalBranch key elt (deleteMin fm_l) fm_r |
|
| | emptyFM :: FiniteMap b a
|
| | findMax :: FiniteMap a b -> (a,b)
| findMax | (Branch key elt _ _ EmptyFM) | = | (key,elt) |
| findMax | (Branch key elt _ _ fm_r) | = | findMax fm_r |
|
| | findMin :: FiniteMap a b -> (a,b)
| findMin | (Branch key elt _ EmptyFM _) | = | (key,elt) |
| findMin | (Branch key elt _ fm_l _) | = | findMin fm_l |
|
| | glueBal :: Ord b => FiniteMap b a -> FiniteMap b a -> FiniteMap b a
| glueBal | EmptyFM fm2 | = | fm2 |
| glueBal | fm1 EmptyFM | = | fm1 |
| glueBal | fm1 fm2 | |
| | | sizeFM fm2 > sizeFM fm1 | = |
| mkBalBranch mid_key2 mid_elt2 fm1 (deleteMin fm2) |
|
| | | otherwise | = |
| mkBalBranch mid_key1 mid_elt1 (deleteMax fm1) fm2 | where |
|
|
| mid_elt10 | (_,mid_elt1) | = | mid_elt1 |
|
|
|
| mid_elt20 | (_,mid_elt2) | = | mid_elt2 |
|
|
|
| mid_key10 | (mid_key1,_) | = | mid_key1 |
|
|
|
| mid_key20 | (mid_key2,_) | = | mid_key2 |
|
|
|
|
|
|
|
|
|
| | mkBalBranch :: Ord b => b -> a -> FiniteMap b a -> FiniteMap b a -> FiniteMap b a
| mkBalBranch | key elt fm_L fm_R | |
| | | size_l + size_r < 2 | = |
| mkBranch 1 key elt fm_L fm_R |
|
| | | size_r > sIZE_RATIO * size_l | = |
| mkBalBranch0 fm_L fm_R fm_R |
|
| | | size_l > sIZE_RATIO * size_r | = |
| mkBalBranch1 fm_L fm_R fm_L |
|
| | | otherwise | = |
| mkBranch 2 key elt fm_L fm_R | where |
| double_L | fm_l (Branch key_r elt_r _ (Branch key_rl elt_rl _ fm_rll fm_rlr) fm_rr) | = | mkBranch 5 key_rl elt_rl (mkBranch 6 key elt fm_l fm_rll) (mkBranch 7 key_r elt_r fm_rlr fm_rr) |
|
| double_R | (Branch key_l elt_l _ fm_ll (Branch key_lr elt_lr _ fm_lrl fm_lrr)) fm_r | = | mkBranch 10 key_lr elt_lr (mkBranch 11 key_l elt_l fm_ll fm_lrl) (mkBranch 12 key elt fm_lrr fm_r) |
|
| mkBalBranch0 | fm_L fm_R (Branch _ _ _ fm_rl fm_rr) | |
| | | sizeFM fm_rl < 2 * sizeFM fm_rr | = |
|
| | | otherwise | = |
|
|
|
| mkBalBranch1 | fm_L fm_R (Branch _ _ _ fm_ll fm_lr) | |
| | | sizeFM fm_lr < 2 * sizeFM fm_ll | = |
|
| | | otherwise | = |
|
|
|
| single_L | fm_l (Branch key_r elt_r _ fm_rl fm_rr) | = | mkBranch 3 key_r elt_r (mkBranch 4 key elt fm_l fm_rl) fm_rr |
|
| single_R | (Branch key_l elt_l _ fm_ll fm_lr) fm_r | = | mkBranch 8 key_l elt_l fm_ll (mkBranch 9 key elt fm_lr fm_r) |
|
|
|
|
|
|
|
|
|
| | mkBranch :: Ord b => Int -> b -> a -> FiniteMap b a -> FiniteMap b a -> FiniteMap b a
| mkBranch | which key elt fm_l fm_r | = |
| let |
| result | | = | Branch key elt (unbox (1 + left_size + right_size)) fm_l fm_r |
|
|
| in | result |
| where |
|
|
| left_ok | | = | left_ok0 fm_l key fm_l |
|
| left_ok0 | fm_l key EmptyFM | = | True |
| left_ok0 | fm_l key (Branch left_key _ _ _ _) | = |
| let |
| biggest_left_key | | = | fst (findMax fm_l) |
|
|
| in | biggest_left_key < key |
|
|
|
|
| right_ok | | = | right_ok0 fm_r key fm_r |
|
| right_ok0 | fm_r key EmptyFM | = | True |
| right_ok0 | fm_r key (Branch right_key _ _ _ _) | = |
| let |
| smallest_right_key | | = | fst (findMin fm_r) |
|
|
| in | key < smallest_right_key |
|
|
|
|
unbox :: Int -> Int
|
|
|
|
| | sIZE_RATIO :: Int
|
| | sizeFM :: FiniteMap b a -> Int
| sizeFM | EmptyFM | = | 0 |
| sizeFM | (Branch _ _ size _ _) | = | size |
|
module Maybe where
| | import qualified FiniteMap
import qualified Prelude
|
Replaced joker patterns by fresh variables and removed binding patterns.
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
mainModule FiniteMap
|
| ((delFromFM :: FiniteMap Int a -> Int -> FiniteMap Int a) :: FiniteMap Int a -> Int -> FiniteMap Int a) |
module FiniteMap where
| | import qualified Maybe
import qualified Prelude
|
| | data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a)
|
| | instance (Eq a, Eq b) => Eq (FiniteMap a b) where
|
| | delFromFM :: Ord b => FiniteMap b a -> b -> FiniteMap b a
| delFromFM | EmptyFM del_key | = | emptyFM |
| delFromFM | (Branch key elt size fm_l fm_r) del_key | |
| | | del_key > key | = |
| mkBalBranch key elt fm_l (delFromFM fm_r del_key) |
|
| | | del_key < key | = |
| mkBalBranch key elt (delFromFM fm_l del_key) fm_r |
|
| | | key == del_key | = |
|
|
|
| | deleteMax :: Ord b => FiniteMap b a -> FiniteMap b a
| deleteMax | (Branch key elt zy fm_l EmptyFM) | = | fm_l |
| deleteMax | (Branch key elt zz fm_l fm_r) | = | mkBalBranch key elt fm_l (deleteMax fm_r) |
|
| | deleteMin :: Ord a => FiniteMap a b -> FiniteMap a b
| deleteMin | (Branch key elt yy EmptyFM fm_r) | = | fm_r |
| deleteMin | (Branch key elt yz fm_l fm_r) | = | mkBalBranch key elt (deleteMin fm_l) fm_r |
|
| | emptyFM :: FiniteMap a b
|
| | findMax :: FiniteMap a b -> (a,b)
| findMax | (Branch key elt xw xx EmptyFM) | = | (key,elt) |
| findMax | (Branch key elt xy xz fm_r) | = | findMax fm_r |
|
| | findMin :: FiniteMap b a -> (b,a)
| findMin | (Branch key elt wy EmptyFM wz) | = | (key,elt) |
| findMin | (Branch key elt xu fm_l xv) | = | findMin fm_l |
|
| | glueBal :: Ord b => FiniteMap b a -> FiniteMap b a -> FiniteMap b a
| glueBal | EmptyFM fm2 | = | fm2 |
| glueBal | fm1 EmptyFM | = | fm1 |
| glueBal | fm1 fm2 | |
| | | sizeFM fm2 > sizeFM fm1 | = |
| mkBalBranch mid_key2 mid_elt2 fm1 (deleteMin fm2) |
|
| | | otherwise | = |
| mkBalBranch mid_key1 mid_elt1 (deleteMax fm1) fm2 | where |
|
|
| mid_elt10 | (yu,mid_elt1) | = | mid_elt1 |
|
|
|
| mid_elt20 | (yv,mid_elt2) | = | mid_elt2 |
|
|
|
| mid_key10 | (mid_key1,yw) | = | mid_key1 |
|
|
|
| mid_key20 | (mid_key2,yx) | = | mid_key2 |
|
|
|
|
|
|
|
|
|
| | mkBalBranch :: Ord a => a -> b -> FiniteMap a b -> FiniteMap a b -> FiniteMap a b
| mkBalBranch | key elt fm_L fm_R | |
| | | size_l + size_r < 2 | = |
| mkBranch 1 key elt fm_L fm_R |
|
| | | size_r > sIZE_RATIO * size_l | = |
| mkBalBranch0 fm_L fm_R fm_R |
|
| | | size_l > sIZE_RATIO * size_r | = |
| mkBalBranch1 fm_L fm_R fm_L |
|
| | | otherwise | = |
| mkBranch 2 key elt fm_L fm_R | where |
| double_L | fm_l (Branch key_r elt_r vvu (Branch key_rl elt_rl vvv fm_rll fm_rlr) fm_rr) | = | mkBranch 5 key_rl elt_rl (mkBranch 6 key elt fm_l fm_rll) (mkBranch 7 key_r elt_r fm_rlr fm_rr) |
|
| double_R | (Branch key_l elt_l vuy fm_ll (Branch key_lr elt_lr vuz fm_lrl fm_lrr)) fm_r | = | mkBranch 10 key_lr elt_lr (mkBranch 11 key_l elt_l fm_ll fm_lrl) (mkBranch 12 key elt fm_lrr fm_r) |
|
| mkBalBranch0 | fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) | |
| | | sizeFM fm_rl < 2 * sizeFM fm_rr | = |
|
| | | otherwise | = |
|
|
|
| mkBalBranch1 | fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) | |
| | | sizeFM fm_lr < 2 * sizeFM fm_ll | = |
|
| | | otherwise | = |
|
|
|
| single_L | fm_l (Branch key_r elt_r vvz fm_rl fm_rr) | = | mkBranch 3 key_r elt_r (mkBranch 4 key elt fm_l fm_rl) fm_rr |
|
| single_R | (Branch key_l elt_l vuu fm_ll fm_lr) fm_r | = | mkBranch 8 key_l elt_l fm_ll (mkBranch 9 key elt fm_lr fm_r) |
|
|
|
|
|
|
|
|
|
| | mkBranch :: Ord b => Int -> b -> a -> FiniteMap b a -> FiniteMap b a -> FiniteMap b a
| mkBranch | which key elt fm_l fm_r | = |
| let |
| result | | = | Branch key elt (unbox (1 + left_size + right_size)) fm_l fm_r |
|
|
| in | result |
| where |
|
|
| left_ok | | = | left_ok0 fm_l key fm_l |
|
| left_ok0 | fm_l key EmptyFM | = | True |
| left_ok0 | fm_l key (Branch left_key wu wv ww wx) | = |
| let |
| biggest_left_key | | = | fst (findMax fm_l) |
|
|
| in | biggest_left_key < key |
|
|
|
|
| right_ok | | = | right_ok0 fm_r key fm_r |
|
| right_ok0 | fm_r key EmptyFM | = | True |
| right_ok0 | fm_r key (Branch right_key vw vx vy vz) | = |
| let |
| smallest_right_key | | = | fst (findMin fm_r) |
|
|
| in | key < smallest_right_key |
|
|
|
|
unbox :: Int -> Int
|
|
|
|
| | sIZE_RATIO :: Int
|
| | sizeFM :: FiniteMap b a -> Int
| sizeFM | EmptyFM | = | 0 |
| sizeFM | (Branch zu zv size zw zx) | = | size |
|
module Maybe where
| | import qualified FiniteMap
import qualified Prelude
|
Cond Reductions:
The following Function with conditions
| glueBal | EmptyFM fm2 | = fm2 |
| glueBal | fm1 EmptyFM | = fm1 |
| glueBal | fm1 fm2 |
| | | sizeFM fm2 > sizeFM fm1 |
| = | mkBalBranch mid_key2 mid_elt2 fm1 (deleteMin fm2) |
|
| | | otherwise |
| = | mkBalBranch mid_key1 mid_elt1 (deleteMax fm1) fm2 |
|
|
| where | |
|
| mid_elt10 | (yu,mid_elt1) | = mid_elt1 |
|
| |
|
| mid_elt20 | (yv,mid_elt2) | = mid_elt2 |
|
| |
|
| mid_key10 | (mid_key1,yw) | = mid_key1 |
|
| |
|
| mid_key20 | (mid_key2,yx) | = mid_key2 |
|
| |
| |
|
is transformed to
| glueBal | EmptyFM fm2 | = glueBal4 EmptyFM fm2 |
| glueBal | fm1 EmptyFM | = glueBal3 fm1 EmptyFM |
| glueBal | fm1 fm2 | = glueBal2 fm1 fm2 |
| glueBal2 | fm1 fm2 | =
| glueBal1 fm1 fm2 (sizeFM fm2 > sizeFM fm1) |
| where |
| glueBal0 | fm1 fm2 True | = mkBalBranch mid_key1 mid_elt1 (deleteMax fm1) fm2 |
|
|
| glueBal1 | fm1 fm2 True | = mkBalBranch mid_key2 mid_elt2 fm1 (deleteMin fm2) |
| glueBal1 | fm1 fm2 False | = glueBal0 fm1 fm2 otherwise |
|
| |
|
| mid_elt10 | (yu,mid_elt1) | = mid_elt1 |
|
| |
|
| mid_elt20 | (yv,mid_elt2) | = mid_elt2 |
|
| |
|
| mid_key10 | (mid_key1,yw) | = mid_key1 |
|
| |
|
| mid_key20 | (mid_key2,yx) | = mid_key2 |
|
| |
| |
|
| glueBal3 | fm1 EmptyFM | = fm1 |
| glueBal3 | vxu vxv | = glueBal2 vxu vxv |
| glueBal4 | EmptyFM fm2 | = fm2 |
| glueBal4 | vxx vxy | = glueBal3 vxx vxy |
The following Function with conditions
| delFromFM | EmptyFM del_key | = emptyFM |
| delFromFM | (Branch key elt size fm_l fm_r) del_key |
| | | del_key > key |
| = | mkBalBranch key elt fm_l (delFromFM fm_r del_key) |
|
| | | del_key < key |
| = | mkBalBranch key elt (delFromFM fm_l del_key) fm_r |
|
| | | key == del_key | |
|
is transformed to
| delFromFM | EmptyFM del_key | = delFromFM4 EmptyFM del_key |
| delFromFM | (Branch key elt size fm_l fm_r) del_key | = delFromFM3 (Branch key elt size fm_l fm_r) del_key |
| delFromFM2 | key elt size fm_l fm_r del_key True | = mkBalBranch key elt fm_l (delFromFM fm_r del_key) |
| delFromFM2 | key elt size fm_l fm_r del_key False | = delFromFM1 key elt size fm_l fm_r del_key (del_key < key) |
| delFromFM1 | key elt size fm_l fm_r del_key True | = mkBalBranch key elt (delFromFM fm_l del_key) fm_r |
| delFromFM1 | key elt size fm_l fm_r del_key False | = delFromFM0 key elt size fm_l fm_r del_key (key == del_key) |
| delFromFM0 | key elt size fm_l fm_r del_key True | = glueBal fm_l fm_r |
| delFromFM3 | (Branch key elt size fm_l fm_r) del_key | = delFromFM2 key elt size fm_l fm_r del_key (del_key > key) |
| delFromFM4 | EmptyFM del_key | = emptyFM |
| delFromFM4 | vyv vyw | = delFromFM3 vyv vyw |
The following Function with conditions
| mkBalBranch1 | fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) |
| | | sizeFM fm_lr < 2 * sizeFM fm_ll | |
| | | otherwise | |
|
is transformed to
| mkBalBranch1 | fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) | = mkBalBranch12 fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) |
| mkBalBranch10 | fm_L fm_R vuv vuw vux fm_ll fm_lr True | = double_R fm_L fm_R |
| mkBalBranch11 | fm_L fm_R vuv vuw vux fm_ll fm_lr True | = single_R fm_L fm_R |
| mkBalBranch11 | fm_L fm_R vuv vuw vux fm_ll fm_lr False | = mkBalBranch10 fm_L fm_R vuv vuw vux fm_ll fm_lr otherwise |
| mkBalBranch12 | fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) | = mkBalBranch11 fm_L fm_R vuv vuw vux fm_ll fm_lr (sizeFM fm_lr < 2 * sizeFM fm_ll) |
The following Function with conditions
| mkBalBranch0 | fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) |
| | | sizeFM fm_rl < 2 * sizeFM fm_rr | |
| | | otherwise | |
|
is transformed to
| mkBalBranch0 | fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) | = mkBalBranch02 fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) |
| mkBalBranch01 | fm_L fm_R vvw vvx vvy fm_rl fm_rr True | = single_L fm_L fm_R |
| mkBalBranch01 | fm_L fm_R vvw vvx vvy fm_rl fm_rr False | = mkBalBranch00 fm_L fm_R vvw vvx vvy fm_rl fm_rr otherwise |
| mkBalBranch00 | fm_L fm_R vvw vvx vvy fm_rl fm_rr True | = double_L fm_L fm_R |
| mkBalBranch02 | fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) | = mkBalBranch01 fm_L fm_R vvw vvx vvy fm_rl fm_rr (sizeFM fm_rl < 2 * sizeFM fm_rr) |
The following Function with conditions
| mkBalBranch | key elt fm_L fm_R |
| | | size_l + size_r < 2 |
| = | mkBranch 1 key elt fm_L fm_R |
|
| | | size_r > sIZE_RATIO * size_l |
| = | mkBalBranch0 fm_L fm_R fm_R |
|
| | | size_l > sIZE_RATIO * size_r |
| = | mkBalBranch1 fm_L fm_R fm_L |
|
| | | otherwise |
| = | mkBranch 2 key elt fm_L fm_R |
|
|
| where |
| double_L | fm_l (Branch key_r elt_r vvu (Branch key_rl elt_rl vvv fm_rll fm_rlr) fm_rr) | = mkBranch 5 key_rl elt_rl (mkBranch 6 key elt fm_l fm_rll) (mkBranch 7 key_r elt_r fm_rlr fm_rr) |
|
|
| double_R | (Branch key_l elt_l vuy fm_ll (Branch key_lr elt_lr vuz fm_lrl fm_lrr)) fm_r | = mkBranch 10 key_lr elt_lr (mkBranch 11 key_l elt_l fm_ll fm_lrl) (mkBranch 12 key elt fm_lrr fm_r) |
|
|
| mkBalBranch0 | fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) |
| | | sizeFM fm_rl < 2 * sizeFM fm_rr | |
| | | otherwise | |
|
|
|
| mkBalBranch1 | fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) |
| | | sizeFM fm_lr < 2 * sizeFM fm_ll | |
| | | otherwise | |
|
|
|
| single_L | fm_l (Branch key_r elt_r vvz fm_rl fm_rr) | = mkBranch 3 key_r elt_r (mkBranch 4 key elt fm_l fm_rl) fm_rr |
|
|
| single_R | (Branch key_l elt_l vuu fm_ll fm_lr) fm_r | = mkBranch 8 key_l elt_l fm_ll (mkBranch 9 key elt fm_lr fm_r) |
|
| |
| |
|
is transformed to
| mkBalBranch | key elt fm_L fm_R | = mkBalBranch6 key elt fm_L fm_R |
| mkBalBranch6 | key elt fm_L fm_R | =
| mkBalBranch5 key elt fm_L fm_R (size_l + size_r < 2) |
| where |
| double_L | fm_l (Branch key_r elt_r vvu (Branch key_rl elt_rl vvv fm_rll fm_rlr) fm_rr) | = mkBranch 5 key_rl elt_rl (mkBranch 6 key elt fm_l fm_rll) (mkBranch 7 key_r elt_r fm_rlr fm_rr) |
|
|
| double_R | (Branch key_l elt_l vuy fm_ll (Branch key_lr elt_lr vuz fm_lrl fm_lrr)) fm_r | = mkBranch 10 key_lr elt_lr (mkBranch 11 key_l elt_l fm_ll fm_lrl) (mkBranch 12 key elt fm_lrr fm_r) |
|
|
| mkBalBranch0 | fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) | = mkBalBranch02 fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) |
|
|
| mkBalBranch00 | fm_L fm_R vvw vvx vvy fm_rl fm_rr True | = double_L fm_L fm_R |
|
|
| mkBalBranch01 | fm_L fm_R vvw vvx vvy fm_rl fm_rr True | = single_L fm_L fm_R |
| mkBalBranch01 | fm_L fm_R vvw vvx vvy fm_rl fm_rr False | = mkBalBranch00 fm_L fm_R vvw vvx vvy fm_rl fm_rr otherwise |
|
|
| mkBalBranch02 | fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) | = mkBalBranch01 fm_L fm_R vvw vvx vvy fm_rl fm_rr (sizeFM fm_rl < 2 * sizeFM fm_rr) |
|
|
| mkBalBranch1 | fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) | = mkBalBranch12 fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) |
|
|
| mkBalBranch10 | fm_L fm_R vuv vuw vux fm_ll fm_lr True | = double_R fm_L fm_R |
|
|
| mkBalBranch11 | fm_L fm_R vuv vuw vux fm_ll fm_lr True | = single_R fm_L fm_R |
| mkBalBranch11 | fm_L fm_R vuv vuw vux fm_ll fm_lr False | = mkBalBranch10 fm_L fm_R vuv vuw vux fm_ll fm_lr otherwise |
|
|
| mkBalBranch12 | fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) | = mkBalBranch11 fm_L fm_R vuv vuw vux fm_ll fm_lr (sizeFM fm_lr < 2 * sizeFM fm_ll) |
|
|
| mkBalBranch2 | key elt fm_L fm_R True | = mkBranch 2 key elt fm_L fm_R |
|
|
| mkBalBranch3 | key elt fm_L fm_R True | = mkBalBranch1 fm_L fm_R fm_L |
| mkBalBranch3 | key elt fm_L fm_R False | = mkBalBranch2 key elt fm_L fm_R otherwise |
|
|
| mkBalBranch4 | key elt fm_L fm_R True | = mkBalBranch0 fm_L fm_R fm_R |
| mkBalBranch4 | key elt fm_L fm_R False | = mkBalBranch3 key elt fm_L fm_R (size_l > sIZE_RATIO * size_r) |
|
|
| mkBalBranch5 | key elt fm_L fm_R True | = mkBranch 1 key elt fm_L fm_R |
| mkBalBranch5 | key elt fm_L fm_R False | = mkBalBranch4 key elt fm_L fm_R (size_r > sIZE_RATIO * size_l) |
|
|
| single_L | fm_l (Branch key_r elt_r vvz fm_rl fm_rr) | = mkBranch 3 key_r elt_r (mkBranch 4 key elt fm_l fm_rl) fm_rr |
|
|
| single_R | (Branch key_l elt_l vuu fm_ll fm_lr) fm_r | = mkBranch 8 key_l elt_l fm_ll (mkBranch 9 key elt fm_lr fm_r) |
|
| |
| |
|
The following Function with conditions
is transformed to
| undefined0 | True | = undefined |
| undefined1 | | = undefined0 False |
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
mainModule FiniteMap
|
| ((delFromFM :: FiniteMap Int a -> Int -> FiniteMap Int a) :: FiniteMap Int a -> Int -> FiniteMap Int a) |
module FiniteMap where
| | import qualified Maybe
import qualified Prelude
|
| | data FiniteMap a b = EmptyFM | Branch a b Int (FiniteMap a b) (FiniteMap a b)
|
| | instance (Eq a, Eq b) => Eq (FiniteMap b a) where
|
| | delFromFM :: Ord a => FiniteMap a b -> a -> FiniteMap a b
| delFromFM | EmptyFM del_key | = | delFromFM4 EmptyFM del_key |
| delFromFM | (Branch key elt size fm_l fm_r) del_key | = | delFromFM3 (Branch key elt size fm_l fm_r) del_key |
|
| |
| delFromFM0 | key elt size fm_l fm_r del_key True | = | glueBal fm_l fm_r |
|
| |
| delFromFM1 | key elt size fm_l fm_r del_key True | = | mkBalBranch key elt (delFromFM fm_l del_key) fm_r |
| delFromFM1 | key elt size fm_l fm_r del_key False | = | delFromFM0 key elt size fm_l fm_r del_key (key == del_key) |
|
| |
| delFromFM2 | key elt size fm_l fm_r del_key True | = | mkBalBranch key elt fm_l (delFromFM fm_r del_key) |
| delFromFM2 | key elt size fm_l fm_r del_key False | = | delFromFM1 key elt size fm_l fm_r del_key (del_key < key) |
|
| |
| delFromFM3 | (Branch key elt size fm_l fm_r) del_key | = | delFromFM2 key elt size fm_l fm_r del_key (del_key > key) |
|
| |
| delFromFM4 | EmptyFM del_key | = | emptyFM |
| delFromFM4 | vyv vyw | = | delFromFM3 vyv vyw |
|
| | deleteMax :: Ord a => FiniteMap a b -> FiniteMap a b
| deleteMax | (Branch key elt zy fm_l EmptyFM) | = | fm_l |
| deleteMax | (Branch key elt zz fm_l fm_r) | = | mkBalBranch key elt fm_l (deleteMax fm_r) |
|
| | deleteMin :: Ord b => FiniteMap b a -> FiniteMap b a
| deleteMin | (Branch key elt yy EmptyFM fm_r) | = | fm_r |
| deleteMin | (Branch key elt yz fm_l fm_r) | = | mkBalBranch key elt (deleteMin fm_l) fm_r |
|
| | emptyFM :: FiniteMap b a
|
| | findMax :: FiniteMap a b -> (a,b)
| findMax | (Branch key elt xw xx EmptyFM) | = | (key,elt) |
| findMax | (Branch key elt xy xz fm_r) | = | findMax fm_r |
|
| | findMin :: FiniteMap b a -> (b,a)
| findMin | (Branch key elt wy EmptyFM wz) | = | (key,elt) |
| findMin | (Branch key elt xu fm_l xv) | = | findMin fm_l |
|
| | glueBal :: Ord b => FiniteMap b a -> FiniteMap b a -> FiniteMap b a
| glueBal | EmptyFM fm2 | = | glueBal4 EmptyFM fm2 |
| glueBal | fm1 EmptyFM | = | glueBal3 fm1 EmptyFM |
| glueBal | fm1 fm2 | = | glueBal2 fm1 fm2 |
|
| |
| glueBal2 | fm1 fm2 | = |
| glueBal1 fm1 fm2 (sizeFM fm2 > sizeFM fm1) | where |
| glueBal0 | fm1 fm2 True | = | mkBalBranch mid_key1 mid_elt1 (deleteMax fm1) fm2 |
|
| glueBal1 | fm1 fm2 True | = | mkBalBranch mid_key2 mid_elt2 fm1 (deleteMin fm2) |
| glueBal1 | fm1 fm2 False | = | glueBal0 fm1 fm2 otherwise |
|
|
|
| mid_elt10 | (yu,mid_elt1) | = | mid_elt1 |
|
|
|
| mid_elt20 | (yv,mid_elt2) | = | mid_elt2 |
|
|
|
| mid_key10 | (mid_key1,yw) | = | mid_key1 |
|
|
|
| mid_key20 | (mid_key2,yx) | = | mid_key2 |
|
|
|
|
|
|
|
|
| |
| glueBal3 | fm1 EmptyFM | = | fm1 |
| glueBal3 | vxu vxv | = | glueBal2 vxu vxv |
|
| |
| glueBal4 | EmptyFM fm2 | = | fm2 |
| glueBal4 | vxx vxy | = | glueBal3 vxx vxy |
|
| | mkBalBranch :: Ord b => b -> a -> FiniteMap b a -> FiniteMap b a -> FiniteMap b a
| mkBalBranch | key elt fm_L fm_R | = | mkBalBranch6 key elt fm_L fm_R |
|
| |
| mkBalBranch6 | key elt fm_L fm_R | = |
| mkBalBranch5 key elt fm_L fm_R (size_l + size_r < 2) | where |
| double_L | fm_l (Branch key_r elt_r vvu (Branch key_rl elt_rl vvv fm_rll fm_rlr) fm_rr) | = | mkBranch 5 key_rl elt_rl (mkBranch 6 key elt fm_l fm_rll) (mkBranch 7 key_r elt_r fm_rlr fm_rr) |
|
| double_R | (Branch key_l elt_l vuy fm_ll (Branch key_lr elt_lr vuz fm_lrl fm_lrr)) fm_r | = | mkBranch 10 key_lr elt_lr (mkBranch 11 key_l elt_l fm_ll fm_lrl) (mkBranch 12 key elt fm_lrr fm_r) |
|
| mkBalBranch0 | fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) | = | mkBalBranch02 fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) |
|
| mkBalBranch00 | fm_L fm_R vvw vvx vvy fm_rl fm_rr True | = | double_L fm_L fm_R |
|
| mkBalBranch01 | fm_L fm_R vvw vvx vvy fm_rl fm_rr True | = | single_L fm_L fm_R |
| mkBalBranch01 | fm_L fm_R vvw vvx vvy fm_rl fm_rr False | = | mkBalBranch00 fm_L fm_R vvw vvx vvy fm_rl fm_rr otherwise |
|
| mkBalBranch02 | fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) | = | mkBalBranch01 fm_L fm_R vvw vvx vvy fm_rl fm_rr (sizeFM fm_rl < 2 * sizeFM fm_rr) |
|
| mkBalBranch1 | fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) | = | mkBalBranch12 fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) |
|
| mkBalBranch10 | fm_L fm_R vuv vuw vux fm_ll fm_lr True | = | double_R fm_L fm_R |
|
| mkBalBranch11 | fm_L fm_R vuv vuw vux fm_ll fm_lr True | = | single_R fm_L fm_R |
| mkBalBranch11 | fm_L fm_R vuv vuw vux fm_ll fm_lr False | = | mkBalBranch10 fm_L fm_R vuv vuw vux fm_ll fm_lr otherwise |
|
| mkBalBranch12 | fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) | = | mkBalBranch11 fm_L fm_R vuv vuw vux fm_ll fm_lr (sizeFM fm_lr < 2 * sizeFM fm_ll) |
|
| mkBalBranch2 | key elt fm_L fm_R True | = | mkBranch 2 key elt fm_L fm_R |
|
| mkBalBranch3 | key elt fm_L fm_R True | = | mkBalBranch1 fm_L fm_R fm_L |
| mkBalBranch3 | key elt fm_L fm_R False | = | mkBalBranch2 key elt fm_L fm_R otherwise |
|
| mkBalBranch4 | key elt fm_L fm_R True | = | mkBalBranch0 fm_L fm_R fm_R |
| mkBalBranch4 | key elt fm_L fm_R False | = | mkBalBranch3 key elt fm_L fm_R (size_l > sIZE_RATIO * size_r) |
|
| mkBalBranch5 | key elt fm_L fm_R True | = | mkBranch 1 key elt fm_L fm_R |
| mkBalBranch5 | key elt fm_L fm_R False | = | mkBalBranch4 key elt fm_L fm_R (size_r > sIZE_RATIO * size_l) |
|
| single_L | fm_l (Branch key_r elt_r vvz fm_rl fm_rr) | = | mkBranch 3 key_r elt_r (mkBranch 4 key elt fm_l fm_rl) fm_rr |
|
| single_R | (Branch key_l elt_l vuu fm_ll fm_lr) fm_r | = | mkBranch 8 key_l elt_l fm_ll (mkBranch 9 key elt fm_lr fm_r) |
|
|
|
|
|
|
|
|
| | mkBranch :: Ord b => Int -> b -> a -> FiniteMap b a -> FiniteMap b a -> FiniteMap b a
| mkBranch | which key elt fm_l fm_r | = |
| let |
| result | | = | Branch key elt (unbox (1 + left_size + right_size)) fm_l fm_r |
|
|
| in | result |
| where |
|
|
| left_ok | | = | left_ok0 fm_l key fm_l |
|
| left_ok0 | fm_l key EmptyFM | = | True |
| left_ok0 | fm_l key (Branch left_key wu wv ww wx) | = |
| let |
| biggest_left_key | | = | fst (findMax fm_l) |
|
|
| in | biggest_left_key < key |
|
|
|
|
| right_ok | | = | right_ok0 fm_r key fm_r |
|
| right_ok0 | fm_r key EmptyFM | = | True |
| right_ok0 | fm_r key (Branch right_key vw vx vy vz) | = |
| let |
| smallest_right_key | | = | fst (findMin fm_r) |
|
|
| in | key < smallest_right_key |
|
|
|
|
unbox :: Int -> Int
|
|
|
|
| | sIZE_RATIO :: Int
|
| | sizeFM :: FiniteMap a b -> Int
| sizeFM | EmptyFM | = | 0 |
| sizeFM | (Branch zu zv size zw zx) | = | size |
|
module Maybe where
| | import qualified FiniteMap
import qualified Prelude
|
Let/Where Reductions:
The bindings of the following Let/Where expression
| let |
| result | | = Branch key elt (unbox (1 + left_size + right_size)) fm_l fm_r |
|
in | result |
|
| where | |
|
| left_ok | | = left_ok0 fm_l key fm_l |
|
|
| left_ok0 | fm_l key EmptyFM | = True |
| left_ok0 | fm_l key (Branch left_key wu wv ww wx) | =
| let |
| biggest_left_key | | = fst (findMax fm_l) |
|
in | biggest_left_key < key |
|
|
| |
|
| right_ok | | = right_ok0 fm_r key fm_r |
|
|
| right_ok0 | fm_r key EmptyFM | = True |
| right_ok0 | fm_r key (Branch right_key vw vx vy vz) | =
| let |
| smallest_right_key | | = fst (findMin fm_r) |
|
in | key < smallest_right_key |
|
|
| |
| |
are unpacked to the following functions on top level
| mkBranchLeft_size | vyz vzu vzv | = sizeFM vyz |
| mkBranchLeft_ok | vyz vzu vzv | = mkBranchLeft_ok0 vyz vzu vzv vyz vzu vyz |
| mkBranchUnbox | vyz vzu vzv x | = x |
| mkBranchBalance_ok | vyz vzu vzv | = True |
| mkBranchRight_ok | vyz vzu vzv | = mkBranchRight_ok0 vyz vzu vzv vzv vzu vzv |
| mkBranchLeft_ok0 | vyz vzu vzv fm_l key EmptyFM | = True |
| mkBranchLeft_ok0 | vyz vzu vzv fm_l key (Branch left_key wu wv ww wx) | = mkBranchLeft_ok0Biggest_left_key fm_l < key |
| mkBranchRight_size | vyz vzu vzv | = sizeFM vzv |
| mkBranchRight_ok0 | vyz vzu vzv fm_r key EmptyFM | = True |
| mkBranchRight_ok0 | vyz vzu vzv fm_r key (Branch right_key vw vx vy vz) | = key < mkBranchRight_ok0Smallest_right_key fm_r |
The bindings of the following Let/Where expression
| let |
| result | | = Branch key elt (unbox (1 + left_size + right_size)) fm_l fm_r |
|
in | result |
are unpacked to the following functions on top level
| mkBranchResult | vzw vzx vzy vzz | = Branch vzw vzx (mkBranchUnbox vzy vzw vzz (1 + mkBranchLeft_size vzy vzw vzz + mkBranchRight_size vzy vzw vzz)) vzy vzz |
The bindings of the following Let/Where expression
| mkBalBranch5 key elt fm_L fm_R (size_l + size_r < 2) |
| where |
| double_L | fm_l (Branch key_r elt_r vvu (Branch key_rl elt_rl vvv fm_rll fm_rlr) fm_rr) | = mkBranch 5 key_rl elt_rl (mkBranch 6 key elt fm_l fm_rll) (mkBranch 7 key_r elt_r fm_rlr fm_rr) |
|
|
| double_R | (Branch key_l elt_l vuy fm_ll (Branch key_lr elt_lr vuz fm_lrl fm_lrr)) fm_r | = mkBranch 10 key_lr elt_lr (mkBranch 11 key_l elt_l fm_ll fm_lrl) (mkBranch 12 key elt fm_lrr fm_r) |
|
|
| mkBalBranch0 | fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) | = mkBalBranch02 fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) |
|
|
| mkBalBranch00 | fm_L fm_R vvw vvx vvy fm_rl fm_rr True | = double_L fm_L fm_R |
|
|
| mkBalBranch01 | fm_L fm_R vvw vvx vvy fm_rl fm_rr True | = single_L fm_L fm_R |
| mkBalBranch01 | fm_L fm_R vvw vvx vvy fm_rl fm_rr False | = mkBalBranch00 fm_L fm_R vvw vvx vvy fm_rl fm_rr otherwise |
|
|
| mkBalBranch02 | fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) | = mkBalBranch01 fm_L fm_R vvw vvx vvy fm_rl fm_rr (sizeFM fm_rl < 2 * sizeFM fm_rr) |
|
|
| mkBalBranch1 | fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) | = mkBalBranch12 fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) |
|
|
| mkBalBranch10 | fm_L fm_R vuv vuw vux fm_ll fm_lr True | = double_R fm_L fm_R |
|
|
| mkBalBranch11 | fm_L fm_R vuv vuw vux fm_ll fm_lr True | = single_R fm_L fm_R |
| mkBalBranch11 | fm_L fm_R vuv vuw vux fm_ll fm_lr False | = mkBalBranch10 fm_L fm_R vuv vuw vux fm_ll fm_lr otherwise |
|
|
| mkBalBranch12 | fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) | = mkBalBranch11 fm_L fm_R vuv vuw vux fm_ll fm_lr (sizeFM fm_lr < 2 * sizeFM fm_ll) |
|
|
| mkBalBranch2 | key elt fm_L fm_R True | = mkBranch 2 key elt fm_L fm_R |
|
|
| mkBalBranch3 | key elt fm_L fm_R True | = mkBalBranch1 fm_L fm_R fm_L |
| mkBalBranch3 | key elt fm_L fm_R False | = mkBalBranch2 key elt fm_L fm_R otherwise |
|
|
| mkBalBranch4 | key elt fm_L fm_R True | = mkBalBranch0 fm_L fm_R fm_R |
| mkBalBranch4 | key elt fm_L fm_R False | = mkBalBranch3 key elt fm_L fm_R (size_l > sIZE_RATIO * size_r) |
|
|
| mkBalBranch5 | key elt fm_L fm_R True | = mkBranch 1 key elt fm_L fm_R |
| mkBalBranch5 | key elt fm_L fm_R False | = mkBalBranch4 key elt fm_L fm_R (size_r > sIZE_RATIO * size_l) |
|
|
| single_L | fm_l (Branch key_r elt_r vvz fm_rl fm_rr) | = mkBranch 3 key_r elt_r (mkBranch 4 key elt fm_l fm_rl) fm_rr |
|
|
| single_R | (Branch key_l elt_l vuu fm_ll fm_lr) fm_r | = mkBranch 8 key_l elt_l fm_ll (mkBranch 9 key elt fm_lr fm_r) |
|
| |
| |
are unpacked to the following functions on top level
| mkBalBranch6Size_l | wuu wuv wuw wux | = sizeFM wuu |
| mkBalBranch6MkBalBranch0 | wuu wuv wuw wux fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) | = mkBalBranch6MkBalBranch02 wuu wuv wuw wux fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) |
| mkBalBranch6MkBalBranch3 | wuu wuv wuw wux key elt fm_L fm_R True | = mkBalBranch6MkBalBranch1 wuu wuv wuw wux fm_L fm_R fm_L |
| mkBalBranch6MkBalBranch3 | wuu wuv wuw wux key elt fm_L fm_R False | = mkBalBranch6MkBalBranch2 wuu wuv wuw wux key elt fm_L fm_R otherwise |
| mkBalBranch6MkBalBranch4 | wuu wuv wuw wux key elt fm_L fm_R True | = mkBalBranch6MkBalBranch0 wuu wuv wuw wux fm_L fm_R fm_R |
| mkBalBranch6MkBalBranch4 | wuu wuv wuw wux key elt fm_L fm_R False | = mkBalBranch6MkBalBranch3 wuu wuv wuw wux key elt fm_L fm_R (mkBalBranch6Size_l wuu wuv wuw wux > sIZE_RATIO * mkBalBranch6Size_r wuu wuv wuw wux) |
| mkBalBranch6MkBalBranch1 | wuu wuv wuw wux fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) | = mkBalBranch6MkBalBranch12 wuu wuv wuw wux fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) |
| mkBalBranch6Single_R | wuu wuv wuw wux (Branch key_l elt_l vuu fm_ll fm_lr) fm_r | = mkBranch 8 key_l elt_l fm_ll (mkBranch 9 wuv wuw fm_lr fm_r) |
| mkBalBranch6Double_R | wuu wuv wuw wux (Branch key_l elt_l vuy fm_ll (Branch key_lr elt_lr vuz fm_lrl fm_lrr)) fm_r | = mkBranch 10 key_lr elt_lr (mkBranch 11 key_l elt_l fm_ll fm_lrl) (mkBranch 12 wuv wuw fm_lrr fm_r) |
| mkBalBranch6MkBalBranch02 | wuu wuv wuw wux fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) | = mkBalBranch6MkBalBranch01 wuu wuv wuw wux fm_L fm_R vvw vvx vvy fm_rl fm_rr (sizeFM fm_rl < 2 * sizeFM fm_rr) |
| mkBalBranch6MkBalBranch12 | wuu wuv wuw wux fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) | = mkBalBranch6MkBalBranch11 wuu wuv wuw wux fm_L fm_R vuv vuw vux fm_ll fm_lr (sizeFM fm_lr < 2 * sizeFM fm_ll) |
| mkBalBranch6Double_L | wuu wuv wuw wux fm_l (Branch key_r elt_r vvu (Branch key_rl elt_rl vvv fm_rll fm_rlr) fm_rr) | = mkBranch 5 key_rl elt_rl (mkBranch 6 wuv wuw fm_l fm_rll) (mkBranch 7 key_r elt_r fm_rlr fm_rr) |
| mkBalBranch6MkBalBranch10 | wuu wuv wuw wux fm_L fm_R vuv vuw vux fm_ll fm_lr True | = mkBalBranch6Double_R wuu wuv wuw wux fm_L fm_R |
| mkBalBranch6MkBalBranch01 | wuu wuv wuw wux fm_L fm_R vvw vvx vvy fm_rl fm_rr True | = mkBalBranch6Single_L wuu wuv wuw wux fm_L fm_R |
| mkBalBranch6MkBalBranch01 | wuu wuv wuw wux fm_L fm_R vvw vvx vvy fm_rl fm_rr False | = mkBalBranch6MkBalBranch00 wuu wuv wuw wux fm_L fm_R vvw vvx vvy fm_rl fm_rr otherwise |
| mkBalBranch6Size_r | wuu wuv wuw wux | = sizeFM wux |
| mkBalBranch6MkBalBranch00 | wuu wuv wuw wux fm_L fm_R vvw vvx vvy fm_rl fm_rr True | = mkBalBranch6Double_L wuu wuv wuw wux fm_L fm_R |
| mkBalBranch6MkBalBranch5 | wuu wuv wuw wux key elt fm_L fm_R True | = mkBranch 1 key elt fm_L fm_R |
| mkBalBranch6MkBalBranch5 | wuu wuv wuw wux key elt fm_L fm_R False | = mkBalBranch6MkBalBranch4 wuu wuv wuw wux key elt fm_L fm_R (mkBalBranch6Size_r wuu wuv wuw wux > sIZE_RATIO * mkBalBranch6Size_l wuu wuv wuw wux) |
| mkBalBranch6Single_L | wuu wuv wuw wux fm_l (Branch key_r elt_r vvz fm_rl fm_rr) | = mkBranch 3 key_r elt_r (mkBranch 4 wuv wuw fm_l fm_rl) fm_rr |
| mkBalBranch6MkBalBranch2 | wuu wuv wuw wux key elt fm_L fm_R True | = mkBranch 2 key elt fm_L fm_R |
| mkBalBranch6MkBalBranch11 | wuu wuv wuw wux fm_L fm_R vuv vuw vux fm_ll fm_lr True | = mkBalBranch6Single_R wuu wuv wuw wux fm_L fm_R |
| mkBalBranch6MkBalBranch11 | wuu wuv wuw wux fm_L fm_R vuv vuw vux fm_ll fm_lr False | = mkBalBranch6MkBalBranch10 wuu wuv wuw wux fm_L fm_R vuv vuw vux fm_ll fm_lr otherwise |
The bindings of the following Let/Where expression
| glueBal1 fm1 fm2 (sizeFM fm2 > sizeFM fm1) |
| where |
| glueBal0 | fm1 fm2 True | = mkBalBranch mid_key1 mid_elt1 (deleteMax fm1) fm2 |
|
|
| glueBal1 | fm1 fm2 True | = mkBalBranch mid_key2 mid_elt2 fm1 (deleteMin fm2) |
| glueBal1 | fm1 fm2 False | = glueBal0 fm1 fm2 otherwise |
|
| |
|
| mid_elt10 | (yu,mid_elt1) | = mid_elt1 |
|
| |
|
| mid_elt20 | (yv,mid_elt2) | = mid_elt2 |
|
| |
|
| mid_key10 | (mid_key1,yw) | = mid_key1 |
|
| |
|
| mid_key20 | (mid_key2,yx) | = mid_key2 |
|
| |
| |
are unpacked to the following functions on top level
| glueBal2GlueBal1 | wuy wuz fm1 fm2 True | = mkBalBranch (glueBal2Mid_key2 wuy wuz) (glueBal2Mid_elt2 wuy wuz) fm1 (deleteMin fm2) |
| glueBal2GlueBal1 | wuy wuz fm1 fm2 False | = glueBal2GlueBal0 wuy wuz fm1 fm2 otherwise |
| glueBal2Mid_key2 | wuy wuz | = glueBal2Mid_key20 wuy wuz (glueBal2Vv3 wuy wuz) |
| glueBal2Mid_elt20 | wuy wuz (yv,mid_elt2) | = mid_elt2 |
| glueBal2Mid_key20 | wuy wuz (mid_key2,yx) | = mid_key2 |
| glueBal2Mid_elt1 | wuy wuz | = glueBal2Mid_elt10 wuy wuz (glueBal2Vv2 wuy wuz) |
| glueBal2GlueBal0 | wuy wuz fm1 fm2 True | = mkBalBranch (glueBal2Mid_key1 wuy wuz) (glueBal2Mid_elt1 wuy wuz) (deleteMax fm1) fm2 |
| glueBal2Vv2 | wuy wuz | = findMax wuy |
| glueBal2Vv3 | wuy wuz | = findMin wuz |
| glueBal2Mid_elt10 | wuy wuz (yu,mid_elt1) | = mid_elt1 |
| glueBal2Mid_key10 | wuy wuz (mid_key1,yw) | = mid_key1 |
| glueBal2Mid_elt2 | wuy wuz | = glueBal2Mid_elt20 wuy wuz (glueBal2Vv3 wuy wuz) |
| glueBal2Mid_key1 | wuy wuz | = glueBal2Mid_key10 wuy wuz (glueBal2Vv2 wuy wuz) |
The bindings of the following Let/Where expression
| let |
| biggest_left_key | | = fst (findMax fm_l) |
|
in | biggest_left_key < key |
are unpacked to the following functions on top level
| mkBranchLeft_ok0Biggest_left_key | wvu | = fst (findMax wvu) |
The bindings of the following Let/Where expression
| let |
| smallest_right_key | | = fst (findMin fm_r) |
|
in | key < smallest_right_key |
are unpacked to the following functions on top level
| mkBranchRight_ok0Smallest_right_key | wvv | = fst (findMin wvv) |
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
mainModule FiniteMap
|
| ((delFromFM :: FiniteMap Int a -> Int -> FiniteMap Int a) :: FiniteMap Int a -> Int -> FiniteMap Int a) |
module FiniteMap where
| | import qualified Maybe
import qualified Prelude
|
| | data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a)
|
| | instance (Eq a, Eq b) => Eq (FiniteMap b a) where
|
| | delFromFM :: Ord a => FiniteMap a b -> a -> FiniteMap a b
| delFromFM | EmptyFM del_key | = | delFromFM4 EmptyFM del_key |
| delFromFM | (Branch key elt size fm_l fm_r) del_key | = | delFromFM3 (Branch key elt size fm_l fm_r) del_key |
|
| |
| delFromFM0 | key elt size fm_l fm_r del_key True | = | glueBal fm_l fm_r |
|
| |
| delFromFM1 | key elt size fm_l fm_r del_key True | = | mkBalBranch key elt (delFromFM fm_l del_key) fm_r |
| delFromFM1 | key elt size fm_l fm_r del_key False | = | delFromFM0 key elt size fm_l fm_r del_key (key == del_key) |
|
| |
| delFromFM2 | key elt size fm_l fm_r del_key True | = | mkBalBranch key elt fm_l (delFromFM fm_r del_key) |
| delFromFM2 | key elt size fm_l fm_r del_key False | = | delFromFM1 key elt size fm_l fm_r del_key (del_key < key) |
|
| |
| delFromFM3 | (Branch key elt size fm_l fm_r) del_key | = | delFromFM2 key elt size fm_l fm_r del_key (del_key > key) |
|
| |
| delFromFM4 | EmptyFM del_key | = | emptyFM |
| delFromFM4 | vyv vyw | = | delFromFM3 vyv vyw |
|
| | deleteMax :: Ord a => FiniteMap a b -> FiniteMap a b
| deleteMax | (Branch key elt zy fm_l EmptyFM) | = | fm_l |
| deleteMax | (Branch key elt zz fm_l fm_r) | = | mkBalBranch key elt fm_l (deleteMax fm_r) |
|
| | deleteMin :: Ord b => FiniteMap b a -> FiniteMap b a
| deleteMin | (Branch key elt yy EmptyFM fm_r) | = | fm_r |
| deleteMin | (Branch key elt yz fm_l fm_r) | = | mkBalBranch key elt (deleteMin fm_l) fm_r |
|
| | emptyFM :: FiniteMap a b
|
| | findMax :: FiniteMap b a -> (b,a)
| findMax | (Branch key elt xw xx EmptyFM) | = | (key,elt) |
| findMax | (Branch key elt xy xz fm_r) | = | findMax fm_r |
|
| | findMin :: FiniteMap a b -> (a,b)
| findMin | (Branch key elt wy EmptyFM wz) | = | (key,elt) |
| findMin | (Branch key elt xu fm_l xv) | = | findMin fm_l |
|
| | glueBal :: Ord b => FiniteMap b a -> FiniteMap b a -> FiniteMap b a
| glueBal | EmptyFM fm2 | = | glueBal4 EmptyFM fm2 |
| glueBal | fm1 EmptyFM | = | glueBal3 fm1 EmptyFM |
| glueBal | fm1 fm2 | = | glueBal2 fm1 fm2 |
|
| |
| glueBal2 | fm1 fm2 | = | glueBal2GlueBal1 fm1 fm2 fm1 fm2 (sizeFM fm2 > sizeFM fm1) |
|
| |
| glueBal2GlueBal0 | wuy wuz fm1 fm2 True | = | mkBalBranch (glueBal2Mid_key1 wuy wuz) (glueBal2Mid_elt1 wuy wuz) (deleteMax fm1) fm2 |
|
| |
| glueBal2GlueBal1 | wuy wuz fm1 fm2 True | = | mkBalBranch (glueBal2Mid_key2 wuy wuz) (glueBal2Mid_elt2 wuy wuz) fm1 (deleteMin fm2) |
| glueBal2GlueBal1 | wuy wuz fm1 fm2 False | = | glueBal2GlueBal0 wuy wuz fm1 fm2 otherwise |
|
| |
| glueBal2Mid_elt1 | wuy wuz | = | glueBal2Mid_elt10 wuy wuz (glueBal2Vv2 wuy wuz) |
|
| |
| glueBal2Mid_elt10 | wuy wuz (yu,mid_elt1) | = | mid_elt1 |
|
| |
| glueBal2Mid_elt2 | wuy wuz | = | glueBal2Mid_elt20 wuy wuz (glueBal2Vv3 wuy wuz) |
|
| |
| glueBal2Mid_elt20 | wuy wuz (yv,mid_elt2) | = | mid_elt2 |
|
| |
| glueBal2Mid_key1 | wuy wuz | = | glueBal2Mid_key10 wuy wuz (glueBal2Vv2 wuy wuz) |
|
| |
| glueBal2Mid_key10 | wuy wuz (mid_key1,yw) | = | mid_key1 |
|
| |
| glueBal2Mid_key2 | wuy wuz | = | glueBal2Mid_key20 wuy wuz (glueBal2Vv3 wuy wuz) |
|
| |
| glueBal2Mid_key20 | wuy wuz (mid_key2,yx) | = | mid_key2 |
|
| |
| glueBal2Vv2 | wuy wuz | = | findMax wuy |
|
| |
| glueBal2Vv3 | wuy wuz | = | findMin wuz |
|
| |
| glueBal3 | fm1 EmptyFM | = | fm1 |
| glueBal3 | vxu vxv | = | glueBal2 vxu vxv |
|
| |
| glueBal4 | EmptyFM fm2 | = | fm2 |
| glueBal4 | vxx vxy | = | glueBal3 vxx vxy |
|
| | mkBalBranch :: Ord a => a -> b -> FiniteMap a b -> FiniteMap a b -> FiniteMap a b
| mkBalBranch | key elt fm_L fm_R | = | mkBalBranch6 key elt fm_L fm_R |
|
| |
| mkBalBranch6 | key elt fm_L fm_R | = | mkBalBranch6MkBalBranch5 fm_L key elt fm_R key elt fm_L fm_R (mkBalBranch6Size_l fm_L key elt fm_R + mkBalBranch6Size_r fm_L key elt fm_R < 2) |
|
| |
| mkBalBranch6Double_L | wuu wuv wuw wux fm_l (Branch key_r elt_r vvu (Branch key_rl elt_rl vvv fm_rll fm_rlr) fm_rr) | = | mkBranch 5 key_rl elt_rl (mkBranch 6 wuv wuw fm_l fm_rll) (mkBranch 7 key_r elt_r fm_rlr fm_rr) |
|
| |
| mkBalBranch6Double_R | wuu wuv wuw wux (Branch key_l elt_l vuy fm_ll (Branch key_lr elt_lr vuz fm_lrl fm_lrr)) fm_r | = | mkBranch 10 key_lr elt_lr (mkBranch 11 key_l elt_l fm_ll fm_lrl) (mkBranch 12 wuv wuw fm_lrr fm_r) |
|
| |
| mkBalBranch6MkBalBranch0 | wuu wuv wuw wux fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) | = | mkBalBranch6MkBalBranch02 wuu wuv wuw wux fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) |
|
| |
| mkBalBranch6MkBalBranch00 | wuu wuv wuw wux fm_L fm_R vvw vvx vvy fm_rl fm_rr True | = | mkBalBranch6Double_L wuu wuv wuw wux fm_L fm_R |
|
| |
| mkBalBranch6MkBalBranch01 | wuu wuv wuw wux fm_L fm_R vvw vvx vvy fm_rl fm_rr True | = | mkBalBranch6Single_L wuu wuv wuw wux fm_L fm_R |
| mkBalBranch6MkBalBranch01 | wuu wuv wuw wux fm_L fm_R vvw vvx vvy fm_rl fm_rr False | = | mkBalBranch6MkBalBranch00 wuu wuv wuw wux fm_L fm_R vvw vvx vvy fm_rl fm_rr otherwise |
|
| |
| mkBalBranch6MkBalBranch02 | wuu wuv wuw wux fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) | = | mkBalBranch6MkBalBranch01 wuu wuv wuw wux fm_L fm_R vvw vvx vvy fm_rl fm_rr (sizeFM fm_rl < 2 * sizeFM fm_rr) |
|
| |
| mkBalBranch6MkBalBranch1 | wuu wuv wuw wux fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) | = | mkBalBranch6MkBalBranch12 wuu wuv wuw wux fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) |
|
| |
| mkBalBranch6MkBalBranch10 | wuu wuv wuw wux fm_L fm_R vuv vuw vux fm_ll fm_lr True | = | mkBalBranch6Double_R wuu wuv wuw wux fm_L fm_R |
|
| |
| mkBalBranch6MkBalBranch11 | wuu wuv wuw wux fm_L fm_R vuv vuw vux fm_ll fm_lr True | = | mkBalBranch6Single_R wuu wuv wuw wux fm_L fm_R |
| mkBalBranch6MkBalBranch11 | wuu wuv wuw wux fm_L fm_R vuv vuw vux fm_ll fm_lr False | = | mkBalBranch6MkBalBranch10 wuu wuv wuw wux fm_L fm_R vuv vuw vux fm_ll fm_lr otherwise |
|
| |
| mkBalBranch6MkBalBranch12 | wuu wuv wuw wux fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) | = | mkBalBranch6MkBalBranch11 wuu wuv wuw wux fm_L fm_R vuv vuw vux fm_ll fm_lr (sizeFM fm_lr < 2 * sizeFM fm_ll) |
|
| |
| mkBalBranch6MkBalBranch2 | wuu wuv wuw wux key elt fm_L fm_R True | = | mkBranch 2 key elt fm_L fm_R |
|
| |
| mkBalBranch6MkBalBranch3 | wuu wuv wuw wux key elt fm_L fm_R True | = | mkBalBranch6MkBalBranch1 wuu wuv wuw wux fm_L fm_R fm_L |
| mkBalBranch6MkBalBranch3 | wuu wuv wuw wux key elt fm_L fm_R False | = | mkBalBranch6MkBalBranch2 wuu wuv wuw wux key elt fm_L fm_R otherwise |
|
| |
| mkBalBranch6MkBalBranch4 | wuu wuv wuw wux key elt fm_L fm_R True | = | mkBalBranch6MkBalBranch0 wuu wuv wuw wux fm_L fm_R fm_R |
| mkBalBranch6MkBalBranch4 | wuu wuv wuw wux key elt fm_L fm_R False | = | mkBalBranch6MkBalBranch3 wuu wuv wuw wux key elt fm_L fm_R (mkBalBranch6Size_l wuu wuv wuw wux > sIZE_RATIO * mkBalBranch6Size_r wuu wuv wuw wux) |
|
| |
| mkBalBranch6MkBalBranch5 | wuu wuv wuw wux key elt fm_L fm_R True | = | mkBranch 1 key elt fm_L fm_R |
| mkBalBranch6MkBalBranch5 | wuu wuv wuw wux key elt fm_L fm_R False | = | mkBalBranch6MkBalBranch4 wuu wuv wuw wux key elt fm_L fm_R (mkBalBranch6Size_r wuu wuv wuw wux > sIZE_RATIO * mkBalBranch6Size_l wuu wuv wuw wux) |
|
| |
| mkBalBranch6Single_L | wuu wuv wuw wux fm_l (Branch key_r elt_r vvz fm_rl fm_rr) | = | mkBranch 3 key_r elt_r (mkBranch 4 wuv wuw fm_l fm_rl) fm_rr |
|
| |
| mkBalBranch6Single_R | wuu wuv wuw wux (Branch key_l elt_l vuu fm_ll fm_lr) fm_r | = | mkBranch 8 key_l elt_l fm_ll (mkBranch 9 wuv wuw fm_lr fm_r) |
|
| |
| mkBalBranch6Size_l | wuu wuv wuw wux | = | sizeFM wuu |
|
| |
| mkBalBranch6Size_r | wuu wuv wuw wux | = | sizeFM wux |
|
| | mkBranch :: Ord b => Int -> b -> a -> FiniteMap b a -> FiniteMap b a -> FiniteMap b a
| mkBranch | which key elt fm_l fm_r | = | mkBranchResult key elt fm_l fm_r |
|
| |
| mkBranchBalance_ok | vyz vzu vzv | = | True |
|
| |
| mkBranchLeft_ok | vyz vzu vzv | = | mkBranchLeft_ok0 vyz vzu vzv vyz vzu vyz |
|
| |
| mkBranchLeft_ok0 | vyz vzu vzv fm_l key EmptyFM | = | True |
| mkBranchLeft_ok0 | vyz vzu vzv fm_l key (Branch left_key wu wv ww wx) | = | mkBranchLeft_ok0Biggest_left_key fm_l < key |
|
| |
| mkBranchLeft_ok0Biggest_left_key | wvu | = | fst (findMax wvu) |
|
| |
| mkBranchLeft_size | vyz vzu vzv | = | sizeFM vyz |
|
| |
| mkBranchResult | vzw vzx vzy vzz | = | Branch vzw vzx (mkBranchUnbox vzy vzw vzz (1 + mkBranchLeft_size vzy vzw vzz + mkBranchRight_size vzy vzw vzz)) vzy vzz |
|
| |
| mkBranchRight_ok | vyz vzu vzv | = | mkBranchRight_ok0 vyz vzu vzv vzv vzu vzv |
|
| |
| mkBranchRight_ok0 | vyz vzu vzv fm_r key EmptyFM | = | True |
| mkBranchRight_ok0 | vyz vzu vzv fm_r key (Branch right_key vw vx vy vz) | = | key < mkBranchRight_ok0Smallest_right_key fm_r |
|
| |
| mkBranchRight_ok0Smallest_right_key | wvv | = | fst (findMin wvv) |
|
| |
| mkBranchRight_size | vyz vzu vzv | = | sizeFM vzv |
|
| | mkBranchUnbox :: Ord a => -> (FiniteMap a b) ( -> a ( -> (FiniteMap a b) (Int -> Int)))
| mkBranchUnbox | vyz vzu vzv x | = | x |
|
| | sIZE_RATIO :: Int
|
| | sizeFM :: FiniteMap a b -> Int
| sizeFM | EmptyFM | = | 0 |
| sizeFM | (Branch zu zv size zw zx) | = | size |
|
module Maybe where
| | import qualified FiniteMap
import qualified Prelude
|
Num Reduction: All numbers are transformed to thier corresponding representation with Pos, Neg, Succ and Zero.
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
mainModule FiniteMap
|
| (delFromFM :: FiniteMap Int a -> Int -> FiniteMap Int a) |
module FiniteMap where
| | import qualified Maybe
import qualified Prelude
|
| | data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a)
|
| | instance (Eq a, Eq b) => Eq (FiniteMap b a) where
|
| | delFromFM :: Ord b => FiniteMap b a -> b -> FiniteMap b a
| delFromFM | EmptyFM del_key | = | delFromFM4 EmptyFM del_key |
| delFromFM | (Branch key elt size fm_l fm_r) del_key | = | delFromFM3 (Branch key elt size fm_l fm_r) del_key |
|
| |
| delFromFM0 | key elt size fm_l fm_r del_key True | = | glueBal fm_l fm_r |
|
| |
| delFromFM1 | key elt size fm_l fm_r del_key True | = | mkBalBranch key elt (delFromFM fm_l del_key) fm_r |
| delFromFM1 | key elt size fm_l fm_r del_key False | = | delFromFM0 key elt size fm_l fm_r del_key (key == del_key) |
|
| |
| delFromFM2 | key elt size fm_l fm_r del_key True | = | mkBalBranch key elt fm_l (delFromFM fm_r del_key) |
| delFromFM2 | key elt size fm_l fm_r del_key False | = | delFromFM1 key elt size fm_l fm_r del_key (del_key < key) |
|
| |
| delFromFM3 | (Branch key elt size fm_l fm_r) del_key | = | delFromFM2 key elt size fm_l fm_r del_key (del_key > key) |
|
| |
| delFromFM4 | EmptyFM del_key | = | emptyFM |
| delFromFM4 | vyv vyw | = | delFromFM3 vyv vyw |
|
| | deleteMax :: Ord a => FiniteMap a b -> FiniteMap a b
| deleteMax | (Branch key elt zy fm_l EmptyFM) | = | fm_l |
| deleteMax | (Branch key elt zz fm_l fm_r) | = | mkBalBranch key elt fm_l (deleteMax fm_r) |
|
| | deleteMin :: Ord b => FiniteMap b a -> FiniteMap b a
| deleteMin | (Branch key elt yy EmptyFM fm_r) | = | fm_r |
| deleteMin | (Branch key elt yz fm_l fm_r) | = | mkBalBranch key elt (deleteMin fm_l) fm_r |
|
| | emptyFM :: FiniteMap b a
|
| | findMax :: FiniteMap b a -> (b,a)
| findMax | (Branch key elt xw xx EmptyFM) | = | (key,elt) |
| findMax | (Branch key elt xy xz fm_r) | = | findMax fm_r |
|
| | findMin :: FiniteMap a b -> (a,b)
| findMin | (Branch key elt wy EmptyFM wz) | = | (key,elt) |
| findMin | (Branch key elt xu fm_l xv) | = | findMin fm_l |
|
| | glueBal :: Ord a => FiniteMap a b -> FiniteMap a b -> FiniteMap a b
| glueBal | EmptyFM fm2 | = | glueBal4 EmptyFM fm2 |
| glueBal | fm1 EmptyFM | = | glueBal3 fm1 EmptyFM |
| glueBal | fm1 fm2 | = | glueBal2 fm1 fm2 |
|
| |
| glueBal2 | fm1 fm2 | = | glueBal2GlueBal1 fm1 fm2 fm1 fm2 (sizeFM fm2 > sizeFM fm1) |
|
| |
| glueBal2GlueBal0 | wuy wuz fm1 fm2 True | = | mkBalBranch (glueBal2Mid_key1 wuy wuz) (glueBal2Mid_elt1 wuy wuz) (deleteMax fm1) fm2 |
|
| |
| glueBal2GlueBal1 | wuy wuz fm1 fm2 True | = | mkBalBranch (glueBal2Mid_key2 wuy wuz) (glueBal2Mid_elt2 wuy wuz) fm1 (deleteMin fm2) |
| glueBal2GlueBal1 | wuy wuz fm1 fm2 False | = | glueBal2GlueBal0 wuy wuz fm1 fm2 otherwise |
|
| |
| glueBal2Mid_elt1 | wuy wuz | = | glueBal2Mid_elt10 wuy wuz (glueBal2Vv2 wuy wuz) |
|
| |
| glueBal2Mid_elt10 | wuy wuz (yu,mid_elt1) | = | mid_elt1 |
|
| |
| glueBal2Mid_elt2 | wuy wuz | = | glueBal2Mid_elt20 wuy wuz (glueBal2Vv3 wuy wuz) |
|
| |
| glueBal2Mid_elt20 | wuy wuz (yv,mid_elt2) | = | mid_elt2 |
|
| |
| glueBal2Mid_key1 | wuy wuz | = | glueBal2Mid_key10 wuy wuz (glueBal2Vv2 wuy wuz) |
|
| |
| glueBal2Mid_key10 | wuy wuz (mid_key1,yw) | = | mid_key1 |
|
| |
| glueBal2Mid_key2 | wuy wuz | = | glueBal2Mid_key20 wuy wuz (glueBal2Vv3 wuy wuz) |
|
| |
| glueBal2Mid_key20 | wuy wuz (mid_key2,yx) | = | mid_key2 |
|
| |
| glueBal2Vv2 | wuy wuz | = | findMax wuy |
|
| |
| glueBal2Vv3 | wuy wuz | = | findMin wuz |
|
| |
| glueBal3 | fm1 EmptyFM | = | fm1 |
| glueBal3 | vxu vxv | = | glueBal2 vxu vxv |
|
| |
| glueBal4 | EmptyFM fm2 | = | fm2 |
| glueBal4 | vxx vxy | = | glueBal3 vxx vxy |
|
| | mkBalBranch :: Ord b => b -> a -> FiniteMap b a -> FiniteMap b a -> FiniteMap b a
| mkBalBranch | key elt fm_L fm_R | = | mkBalBranch6 key elt fm_L fm_R |
|
| |
| mkBalBranch6 | key elt fm_L fm_R | = | mkBalBranch6MkBalBranch5 fm_L key elt fm_R key elt fm_L fm_R (mkBalBranch6Size_l fm_L key elt fm_R + mkBalBranch6Size_r fm_L key elt fm_R < Pos (Succ (Succ Zero))) |
|
| |
| mkBalBranch6Double_L | wuu wuv wuw wux fm_l (Branch key_r elt_r vvu (Branch key_rl elt_rl vvv fm_rll fm_rlr) fm_rr) | = | mkBranch (Pos (Succ (Succ (Succ (Succ (Succ Zero)))))) key_rl elt_rl (mkBranch (Pos (Succ (Succ (Succ (Succ (Succ (Succ Zero))))))) wuv wuw fm_l fm_rll) (mkBranch (Pos (Succ (Succ (Succ (Succ (Succ (Succ (Succ Zero)))))))) key_r elt_r fm_rlr fm_rr) |
|
| |
| mkBalBranch6Double_R | wuu wuv wuw wux (Branch key_l elt_l vuy fm_ll (Branch key_lr elt_lr vuz fm_lrl fm_lrr)) fm_r | = | mkBranch (Pos (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ Zero))))))))))) key_lr elt_lr (mkBranch (Pos (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ Zero)))))))))))) key_l elt_l fm_ll fm_lrl) (mkBranch (Pos (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ Zero))))))))))))) wuv wuw fm_lrr fm_r) |
|
| |
| mkBalBranch6MkBalBranch0 | wuu wuv wuw wux fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) | = | mkBalBranch6MkBalBranch02 wuu wuv wuw wux fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) |
|
| |
| mkBalBranch6MkBalBranch00 | wuu wuv wuw wux fm_L fm_R vvw vvx vvy fm_rl fm_rr True | = | mkBalBranch6Double_L wuu wuv wuw wux fm_L fm_R |
|
| |
| mkBalBranch6MkBalBranch01 | wuu wuv wuw wux fm_L fm_R vvw vvx vvy fm_rl fm_rr True | = | mkBalBranch6Single_L wuu wuv wuw wux fm_L fm_R |
| mkBalBranch6MkBalBranch01 | wuu wuv wuw wux fm_L fm_R vvw vvx vvy fm_rl fm_rr False | = | mkBalBranch6MkBalBranch00 wuu wuv wuw wux fm_L fm_R vvw vvx vvy fm_rl fm_rr otherwise |
|
| |
| mkBalBranch6MkBalBranch02 | wuu wuv wuw wux fm_L fm_R (Branch vvw vvx vvy fm_rl fm_rr) | = | mkBalBranch6MkBalBranch01 wuu wuv wuw wux fm_L fm_R vvw vvx vvy fm_rl fm_rr (sizeFM fm_rl < Pos (Succ (Succ Zero)) * sizeFM fm_rr) |
|
| |
| mkBalBranch6MkBalBranch1 | wuu wuv wuw wux fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) | = | mkBalBranch6MkBalBranch12 wuu wuv wuw wux fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) |
|
| |
| mkBalBranch6MkBalBranch10 | wuu wuv wuw wux fm_L fm_R vuv vuw vux fm_ll fm_lr True | = | mkBalBranch6Double_R wuu wuv wuw wux fm_L fm_R |
|
| |
| mkBalBranch6MkBalBranch11 | wuu wuv wuw wux fm_L fm_R vuv vuw vux fm_ll fm_lr True | = | mkBalBranch6Single_R wuu wuv wuw wux fm_L fm_R |
| mkBalBranch6MkBalBranch11 | wuu wuv wuw wux fm_L fm_R vuv vuw vux fm_ll fm_lr False | = | mkBalBranch6MkBalBranch10 wuu wuv wuw wux fm_L fm_R vuv vuw vux fm_ll fm_lr otherwise |
|
| |
| mkBalBranch6MkBalBranch12 | wuu wuv wuw wux fm_L fm_R (Branch vuv vuw vux fm_ll fm_lr) | = | mkBalBranch6MkBalBranch11 wuu wuv wuw wux fm_L fm_R vuv vuw vux fm_ll fm_lr (sizeFM fm_lr < Pos (Succ (Succ Zero)) * sizeFM fm_ll) |
|
| |
| mkBalBranch6MkBalBranch2 | wuu wuv wuw wux key elt fm_L fm_R True | = | mkBranch (Pos (Succ (Succ Zero))) key elt fm_L fm_R |
|
| |
| mkBalBranch6MkBalBranch3 | wuu wuv wuw wux key elt fm_L fm_R True | = | mkBalBranch6MkBalBranch1 wuu wuv wuw wux fm_L fm_R fm_L |
| mkBalBranch6MkBalBranch3 | wuu wuv wuw wux key elt fm_L fm_R False | = | mkBalBranch6MkBalBranch2 wuu wuv wuw wux key elt fm_L fm_R otherwise |
|
| |
| mkBalBranch6MkBalBranch4 | wuu wuv wuw wux key elt fm_L fm_R True | = | mkBalBranch6MkBalBranch0 wuu wuv wuw wux fm_L fm_R fm_R |
| mkBalBranch6MkBalBranch4 | wuu wuv wuw wux key elt fm_L fm_R False | = | mkBalBranch6MkBalBranch3 wuu wuv wuw wux key elt fm_L fm_R (mkBalBranch6Size_l wuu wuv wuw wux > sIZE_RATIO * mkBalBranch6Size_r wuu wuv wuw wux) |
|
| |
| mkBalBranch6MkBalBranch5 | wuu wuv wuw wux key elt fm_L fm_R True | = | mkBranch (Pos (Succ Zero)) key elt fm_L fm_R |
| mkBalBranch6MkBalBranch5 | wuu wuv wuw wux key elt fm_L fm_R False | = | mkBalBranch6MkBalBranch4 wuu wuv wuw wux key elt fm_L fm_R (mkBalBranch6Size_r wuu wuv wuw wux > sIZE_RATIO * mkBalBranch6Size_l wuu wuv wuw wux) |
|
| |
| mkBalBranch6Single_L | wuu wuv wuw wux fm_l (Branch key_r elt_r vvz fm_rl fm_rr) | = | mkBranch (Pos (Succ (Succ (Succ Zero)))) key_r elt_r (mkBranch (Pos (Succ (Succ (Succ (Succ Zero))))) wuv wuw fm_l fm_rl) fm_rr |
|
| |
| mkBalBranch6Single_R | wuu wuv wuw wux (Branch key_l elt_l vuu fm_ll fm_lr) fm_r | = | mkBranch (Pos (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ Zero))))))))) key_l elt_l fm_ll (mkBranch (Pos (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ (Succ Zero)))))))))) wuv wuw fm_lr fm_r) |
|
| |
| mkBalBranch6Size_l | wuu wuv wuw wux | = | sizeFM wuu |
|
| |
| mkBalBranch6Size_r | wuu wuv wuw wux | = | sizeFM wux |
|
| | mkBranch :: Ord a => Int -> a -> b -> FiniteMap a b -> FiniteMap a b -> FiniteMap a b
| mkBranch | which key elt fm_l fm_r | = | mkBranchResult key elt fm_l fm_r |
|
| |
| mkBranchBalance_ok | vyz vzu vzv | = | True |
|
| |
| mkBranchLeft_ok | vyz vzu vzv | = | mkBranchLeft_ok0 vyz vzu vzv vyz vzu vyz |
|
| |
| mkBranchLeft_ok0 | vyz vzu vzv fm_l key EmptyFM | = | True |
| mkBranchLeft_ok0 | vyz vzu vzv fm_l key (Branch left_key wu wv ww wx) | = | mkBranchLeft_ok0Biggest_left_key fm_l < key |
|
| |
| mkBranchLeft_ok0Biggest_left_key | wvu | = | fst (findMax wvu) |
|
| |
| mkBranchLeft_size | vyz vzu vzv | = | sizeFM vyz |
|
| |
| mkBranchResult | vzw vzx vzy vzz | = | Branch vzw vzx (mkBranchUnbox vzy vzw vzz (Pos (Succ Zero) + mkBranchLeft_size vzy vzw vzz + mkBranchRight_size vzy vzw vzz)) vzy vzz |
|
| |
| mkBranchRight_ok | vyz vzu vzv | = | mkBranchRight_ok0 vyz vzu vzv vzv vzu vzv |
|
| |
| mkBranchRight_ok0 | vyz vzu vzv fm_r key EmptyFM | = | True |
| mkBranchRight_ok0 | vyz vzu vzv fm_r key (Branch right_key vw vx vy vz) | = | key < mkBranchRight_ok0Smallest_right_key fm_r |
|
| |
| mkBranchRight_ok0Smallest_right_key | wvv | = | fst (findMin wvv) |
|
| |
| mkBranchRight_size | vyz vzu vzv | = | sizeFM vzv |
|
| | mkBranchUnbox :: Ord a => -> (FiniteMap a b) ( -> a ( -> (FiniteMap a b) (Int -> Int)))
| mkBranchUnbox | vyz vzu vzv x | = | x |
|
| | sIZE_RATIO :: Int
| sIZE_RATIO | | = | Pos (Succ (Succ (Succ (Succ (Succ Zero))))) |
|
| | sizeFM :: FiniteMap a b -> Int
| sizeFM | EmptyFM | = | Pos Zero |
| sizeFM | (Branch zu zv size zw zx) | = | size |
|
module Maybe where
| | import qualified FiniteMap
import qualified Prelude
|
Haskell To QDPs
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_key10(wvw1667, wvw1668, wvw1669, wvw1670, wvw1671, wvw1672, wvw1673, wvw1674, wvw1675, wvw1676, wvw1677, wvw1678, Branch(wvw16790, wvw16791, wvw16792, wvw16793, wvw16794), h, ba) → new_glueBal2Mid_key10(wvw1667, wvw1668, wvw1669, wvw1670, wvw1671, wvw1672, wvw1673, wvw1674, wvw16790, wvw16791, wvw16792, wvw16793, wvw16794, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_key10(wvw1667, wvw1668, wvw1669, wvw1670, wvw1671, wvw1672, wvw1673, wvw1674, wvw1675, wvw1676, wvw1677, wvw1678, Branch(wvw16790, wvw16791, wvw16792, wvw16793, wvw16794), h, ba) → new_glueBal2Mid_key10(wvw1667, wvw1668, wvw1669, wvw1670, wvw1671, wvw1672, wvw1673, wvw1674, wvw16790, wvw16791, wvw16792, wvw16793, wvw16794, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 13 > 9, 13 > 10, 13 > 11, 13 > 12, 13 > 13, 14 >= 14, 15 >= 15
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_elt10(wvw1681, wvw1682, wvw1683, wvw1684, wvw1685, wvw1686, wvw1687, wvw1688, wvw1689, wvw1690, wvw1691, wvw1692, Branch(wvw16930, wvw16931, wvw16932, wvw16933, wvw16934), h, ba) → new_glueBal2Mid_elt10(wvw1681, wvw1682, wvw1683, wvw1684, wvw1685, wvw1686, wvw1687, wvw1688, wvw16930, wvw16931, wvw16932, wvw16933, wvw16934, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_elt10(wvw1681, wvw1682, wvw1683, wvw1684, wvw1685, wvw1686, wvw1687, wvw1688, wvw1689, wvw1690, wvw1691, wvw1692, Branch(wvw16930, wvw16931, wvw16932, wvw16933, wvw16934), h, ba) → new_glueBal2Mid_elt10(wvw1681, wvw1682, wvw1683, wvw1684, wvw1685, wvw1686, wvw1687, wvw1688, wvw16930, wvw16931, wvw16932, wvw16933, wvw16934, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 13 > 9, 13 > 10, 13 > 11, 13 > 12, 13 > 13, 14 >= 14, 15 >= 15
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_elt20(wvw1521, wvw1522, wvw1523, wvw1524, wvw1525, wvw1526, wvw1527, wvw1528, wvw1529, wvw1530, wvw1531, wvw1532, Branch(wvw15330, wvw15331, wvw15332, wvw15333, wvw15334), wvw1534, h, ba) → new_glueBal2Mid_elt20(wvw1521, wvw1522, wvw1523, wvw1524, wvw1525, wvw1526, wvw1527, wvw1528, wvw1529, wvw15330, wvw15331, wvw15332, wvw15333, wvw15334, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_elt20(wvw1521, wvw1522, wvw1523, wvw1524, wvw1525, wvw1526, wvw1527, wvw1528, wvw1529, wvw1530, wvw1531, wvw1532, Branch(wvw15330, wvw15331, wvw15332, wvw15333, wvw15334), wvw1534, h, ba) → new_glueBal2Mid_elt20(wvw1521, wvw1522, wvw1523, wvw1524, wvw1525, wvw1526, wvw1527, wvw1528, wvw1529, wvw15330, wvw15331, wvw15332, wvw15333, wvw15334, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 13 > 10, 13 > 11, 13 > 12, 13 > 13, 13 > 14, 15 >= 15, 16 >= 16
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_key20(wvw1506, wvw1507, wvw1508, wvw1509, wvw1510, wvw1511, wvw1512, wvw1513, wvw1514, wvw1515, wvw1516, wvw1517, Branch(wvw15180, wvw15181, wvw15182, wvw15183, wvw15184), wvw1519, h, ba) → new_glueBal2Mid_key20(wvw1506, wvw1507, wvw1508, wvw1509, wvw1510, wvw1511, wvw1512, wvw1513, wvw1514, wvw15180, wvw15181, wvw15182, wvw15183, wvw15184, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_key20(wvw1506, wvw1507, wvw1508, wvw1509, wvw1510, wvw1511, wvw1512, wvw1513, wvw1514, wvw1515, wvw1516, wvw1517, Branch(wvw15180, wvw15181, wvw15182, wvw15183, wvw15184), wvw1519, h, ba) → new_glueBal2Mid_key20(wvw1506, wvw1507, wvw1508, wvw1509, wvw1510, wvw1511, wvw1512, wvw1513, wvw1514, wvw15180, wvw15181, wvw15182, wvw15183, wvw15184, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 13 > 10, 13 > 11, 13 > 12, 13 > 13, 13 > 14, 15 >= 15, 16 >= 16
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_key100(wvw1639, wvw1640, wvw1641, wvw1642, wvw1643, wvw1644, wvw1645, wvw1646, wvw1647, wvw1648, wvw1649, wvw1650, Branch(wvw16510, wvw16511, wvw16512, wvw16513, wvw16514), h, ba) → new_glueBal2Mid_key100(wvw1639, wvw1640, wvw1641, wvw1642, wvw1643, wvw1644, wvw1645, wvw1646, wvw16510, wvw16511, wvw16512, wvw16513, wvw16514, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_key100(wvw1639, wvw1640, wvw1641, wvw1642, wvw1643, wvw1644, wvw1645, wvw1646, wvw1647, wvw1648, wvw1649, wvw1650, Branch(wvw16510, wvw16511, wvw16512, wvw16513, wvw16514), h, ba) → new_glueBal2Mid_key100(wvw1639, wvw1640, wvw1641, wvw1642, wvw1643, wvw1644, wvw1645, wvw1646, wvw16510, wvw16511, wvw16512, wvw16513, wvw16514, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 13 > 9, 13 > 10, 13 > 11, 13 > 12, 13 > 13, 14 >= 14, 15 >= 15
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_elt100(wvw1653, wvw1654, wvw1655, wvw1656, wvw1657, wvw1658, wvw1659, wvw1660, wvw1661, wvw1662, wvw1663, wvw1664, Branch(wvw16650, wvw16651, wvw16652, wvw16653, wvw16654), h, ba) → new_glueBal2Mid_elt100(wvw1653, wvw1654, wvw1655, wvw1656, wvw1657, wvw1658, wvw1659, wvw1660, wvw16650, wvw16651, wvw16652, wvw16653, wvw16654, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_elt100(wvw1653, wvw1654, wvw1655, wvw1656, wvw1657, wvw1658, wvw1659, wvw1660, wvw1661, wvw1662, wvw1663, wvw1664, Branch(wvw16650, wvw16651, wvw16652, wvw16653, wvw16654), h, ba) → new_glueBal2Mid_elt100(wvw1653, wvw1654, wvw1655, wvw1656, wvw1657, wvw1658, wvw1659, wvw1660, wvw16650, wvw16651, wvw16652, wvw16653, wvw16654, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 13 > 9, 13 > 10, 13 > 11, 13 > 12, 13 > 13, 14 >= 14, 15 >= 15
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_key101(wvw1609, wvw1610, wvw1611, wvw1612, wvw1613, wvw1614, wvw1615, wvw1616, wvw1617, wvw1618, wvw1619, wvw1620, wvw1621, Branch(wvw16220, wvw16221, wvw16222, wvw16223, wvw16224), h, ba) → new_glueBal2Mid_key101(wvw1609, wvw1610, wvw1611, wvw1612, wvw1613, wvw1614, wvw1615, wvw1616, wvw1617, wvw16220, wvw16221, wvw16222, wvw16223, wvw16224, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_key101(wvw1609, wvw1610, wvw1611, wvw1612, wvw1613, wvw1614, wvw1615, wvw1616, wvw1617, wvw1618, wvw1619, wvw1620, wvw1621, Branch(wvw16220, wvw16221, wvw16222, wvw16223, wvw16224), h, ba) → new_glueBal2Mid_key101(wvw1609, wvw1610, wvw1611, wvw1612, wvw1613, wvw1614, wvw1615, wvw1616, wvw1617, wvw16220, wvw16221, wvw16222, wvw16223, wvw16224, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 14 > 10, 14 > 11, 14 > 12, 14 > 13, 14 > 14, 15 >= 15, 16 >= 16
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_elt101(wvw1624, wvw1625, wvw1626, wvw1627, wvw1628, wvw1629, wvw1630, wvw1631, wvw1632, wvw1633, wvw1634, wvw1635, wvw1636, Branch(wvw16370, wvw16371, wvw16372, wvw16373, wvw16374), h, ba) → new_glueBal2Mid_elt101(wvw1624, wvw1625, wvw1626, wvw1627, wvw1628, wvw1629, wvw1630, wvw1631, wvw1632, wvw16370, wvw16371, wvw16372, wvw16373, wvw16374, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_elt101(wvw1624, wvw1625, wvw1626, wvw1627, wvw1628, wvw1629, wvw1630, wvw1631, wvw1632, wvw1633, wvw1634, wvw1635, wvw1636, Branch(wvw16370, wvw16371, wvw16372, wvw16373, wvw16374), h, ba) → new_glueBal2Mid_elt101(wvw1624, wvw1625, wvw1626, wvw1627, wvw1628, wvw1629, wvw1630, wvw1631, wvw1632, wvw16370, wvw16371, wvw16372, wvw16373, wvw16374, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 14 > 10, 14 > 11, 14 > 12, 14 > 13, 14 > 14, 15 >= 15, 16 >= 16
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_key102(wvw2025, wvw2026, wvw2027, wvw2028, wvw2029, wvw2030, wvw2031, wvw2032, wvw2033, wvw2034, wvw2035, wvw2036, wvw2037, Branch(wvw20380, wvw20381, wvw20382, wvw20383, wvw20384), h, ba) → new_glueBal2Mid_key102(wvw2025, wvw2026, wvw2027, wvw2028, wvw2029, wvw2030, wvw2031, wvw2032, wvw2033, wvw20380, wvw20381, wvw20382, wvw20383, wvw20384, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_key102(wvw2025, wvw2026, wvw2027, wvw2028, wvw2029, wvw2030, wvw2031, wvw2032, wvw2033, wvw2034, wvw2035, wvw2036, wvw2037, Branch(wvw20380, wvw20381, wvw20382, wvw20383, wvw20384), h, ba) → new_glueBal2Mid_key102(wvw2025, wvw2026, wvw2027, wvw2028, wvw2029, wvw2030, wvw2031, wvw2032, wvw2033, wvw20380, wvw20381, wvw20382, wvw20383, wvw20384, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 14 > 10, 14 > 11, 14 > 12, 14 > 13, 14 > 14, 15 >= 15, 16 >= 16
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_elt102(wvw2010, wvw2011, wvw2012, wvw2013, wvw2014, wvw2015, wvw2016, wvw2017, wvw2018, wvw2019, wvw2020, wvw2021, wvw2022, Branch(wvw20230, wvw20231, wvw20232, wvw20233, wvw20234), h, ba) → new_glueBal2Mid_elt102(wvw2010, wvw2011, wvw2012, wvw2013, wvw2014, wvw2015, wvw2016, wvw2017, wvw2018, wvw20230, wvw20231, wvw20232, wvw20233, wvw20234, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_elt102(wvw2010, wvw2011, wvw2012, wvw2013, wvw2014, wvw2015, wvw2016, wvw2017, wvw2018, wvw2019, wvw2020, wvw2021, wvw2022, Branch(wvw20230, wvw20231, wvw20232, wvw20233, wvw20234), h, ba) → new_glueBal2Mid_elt102(wvw2010, wvw2011, wvw2012, wvw2013, wvw2014, wvw2015, wvw2016, wvw2017, wvw2018, wvw20230, wvw20231, wvw20232, wvw20233, wvw20234, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 14 > 10, 14 > 11, 14 > 12, 14 > 13, 14 > 14, 15 >= 15, 16 >= 16
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_key103(wvw2262, wvw2263, wvw2264, wvw2265, wvw2266, wvw2267, wvw2268, wvw2269, wvw2270, wvw2271, wvw2272, wvw2273, wvw2274, wvw2275, Branch(wvw22760, wvw22761, wvw22762, wvw22763, wvw22764), h, ba) → new_glueBal2Mid_key103(wvw2262, wvw2263, wvw2264, wvw2265, wvw2266, wvw2267, wvw2268, wvw2269, wvw2270, wvw2271, wvw22760, wvw22761, wvw22762, wvw22763, wvw22764, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_key103(wvw2262, wvw2263, wvw2264, wvw2265, wvw2266, wvw2267, wvw2268, wvw2269, wvw2270, wvw2271, wvw2272, wvw2273, wvw2274, wvw2275, Branch(wvw22760, wvw22761, wvw22762, wvw22763, wvw22764), h, ba) → new_glueBal2Mid_key103(wvw2262, wvw2263, wvw2264, wvw2265, wvw2266, wvw2267, wvw2268, wvw2269, wvw2270, wvw2271, wvw22760, wvw22761, wvw22762, wvw22763, wvw22764, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 15 > 11, 15 > 12, 15 > 13, 15 > 14, 15 > 15, 16 >= 16, 17 >= 17
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_elt103(wvw2246, wvw2247, wvw2248, wvw2249, wvw2250, wvw2251, wvw2252, wvw2253, wvw2254, wvw2255, wvw2256, wvw2257, wvw2258, wvw2259, Branch(wvw22600, wvw22601, wvw22602, wvw22603, wvw22604), h, ba) → new_glueBal2Mid_elt103(wvw2246, wvw2247, wvw2248, wvw2249, wvw2250, wvw2251, wvw2252, wvw2253, wvw2254, wvw2255, wvw22600, wvw22601, wvw22602, wvw22603, wvw22604, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_elt103(wvw2246, wvw2247, wvw2248, wvw2249, wvw2250, wvw2251, wvw2252, wvw2253, wvw2254, wvw2255, wvw2256, wvw2257, wvw2258, wvw2259, Branch(wvw22600, wvw22601, wvw22602, wvw22603, wvw22604), h, ba) → new_glueBal2Mid_elt103(wvw2246, wvw2247, wvw2248, wvw2249, wvw2250, wvw2251, wvw2252, wvw2253, wvw2254, wvw2255, wvw22600, wvw22601, wvw22602, wvw22603, wvw22604, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 15 > 11, 15 > 12, 15 > 13, 15 > 14, 15 > 15, 16 >= 16, 17 >= 17
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_elt200(wvw2349, wvw2350, wvw2351, wvw2352, wvw2353, wvw2354, wvw2355, wvw2356, wvw2357, wvw2358, wvw2359, wvw2360, wvw2361, Branch(wvw23620, wvw23621, wvw23622, wvw23623, wvw23624), wvw2363, h, ba) → new_glueBal2Mid_elt200(wvw2349, wvw2350, wvw2351, wvw2352, wvw2353, wvw2354, wvw2355, wvw2356, wvw2357, wvw2358, wvw23620, wvw23621, wvw23622, wvw23623, wvw23624, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_elt200(wvw2349, wvw2350, wvw2351, wvw2352, wvw2353, wvw2354, wvw2355, wvw2356, wvw2357, wvw2358, wvw2359, wvw2360, wvw2361, Branch(wvw23620, wvw23621, wvw23622, wvw23623, wvw23624), wvw2363, h, ba) → new_glueBal2Mid_elt200(wvw2349, wvw2350, wvw2351, wvw2352, wvw2353, wvw2354, wvw2355, wvw2356, wvw2357, wvw2358, wvw23620, wvw23621, wvw23622, wvw23623, wvw23624, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 14 > 11, 14 > 12, 14 > 13, 14 > 14, 14 > 15, 16 >= 16, 17 >= 17
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_key200(wvw2333, wvw2334, wvw2335, wvw2336, wvw2337, wvw2338, wvw2339, wvw2340, wvw2341, wvw2342, wvw2343, wvw2344, wvw2345, Branch(wvw23460, wvw23461, wvw23462, wvw23463, wvw23464), wvw2347, h, ba) → new_glueBal2Mid_key200(wvw2333, wvw2334, wvw2335, wvw2336, wvw2337, wvw2338, wvw2339, wvw2340, wvw2341, wvw2342, wvw23460, wvw23461, wvw23462, wvw23463, wvw23464, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_key200(wvw2333, wvw2334, wvw2335, wvw2336, wvw2337, wvw2338, wvw2339, wvw2340, wvw2341, wvw2342, wvw2343, wvw2344, wvw2345, Branch(wvw23460, wvw23461, wvw23462, wvw23463, wvw23464), wvw2347, h, ba) → new_glueBal2Mid_key200(wvw2333, wvw2334, wvw2335, wvw2336, wvw2337, wvw2338, wvw2339, wvw2340, wvw2341, wvw2342, wvw23460, wvw23461, wvw23462, wvw23463, wvw23464, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 14 > 11, 14 > 12, 14 > 13, 14 > 14, 14 > 15, 16 >= 16, 17 >= 17
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_key104(wvw1979, wvw1980, wvw1981, wvw1982, wvw1983, wvw1984, wvw1985, wvw1986, wvw1987, wvw1988, wvw1989, wvw1990, wvw1991, wvw1992, Branch(wvw19930, wvw19931, wvw19932, wvw19933, wvw19934), h, ba) → new_glueBal2Mid_key104(wvw1979, wvw1980, wvw1981, wvw1982, wvw1983, wvw1984, wvw1985, wvw1986, wvw1987, wvw1988, wvw19930, wvw19931, wvw19932, wvw19933, wvw19934, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_key104(wvw1979, wvw1980, wvw1981, wvw1982, wvw1983, wvw1984, wvw1985, wvw1986, wvw1987, wvw1988, wvw1989, wvw1990, wvw1991, wvw1992, Branch(wvw19930, wvw19931, wvw19932, wvw19933, wvw19934), h, ba) → new_glueBal2Mid_key104(wvw1979, wvw1980, wvw1981, wvw1982, wvw1983, wvw1984, wvw1985, wvw1986, wvw1987, wvw1988, wvw19930, wvw19931, wvw19932, wvw19933, wvw19934, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 15 > 11, 15 > 12, 15 > 13, 15 > 14, 15 > 15, 16 >= 16, 17 >= 17
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_elt104(wvw1963, wvw1964, wvw1965, wvw1966, wvw1967, wvw1968, wvw1969, wvw1970, wvw1971, wvw1972, wvw1973, wvw1974, wvw1975, wvw1976, Branch(wvw19770, wvw19771, wvw19772, wvw19773, wvw19774), h, ba) → new_glueBal2Mid_elt104(wvw1963, wvw1964, wvw1965, wvw1966, wvw1967, wvw1968, wvw1969, wvw1970, wvw1971, wvw1972, wvw19770, wvw19771, wvw19772, wvw19773, wvw19774, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_elt104(wvw1963, wvw1964, wvw1965, wvw1966, wvw1967, wvw1968, wvw1969, wvw1970, wvw1971, wvw1972, wvw1973, wvw1974, wvw1975, wvw1976, Branch(wvw19770, wvw19771, wvw19772, wvw19773, wvw19774), h, ba) → new_glueBal2Mid_elt104(wvw1963, wvw1964, wvw1965, wvw1966, wvw1967, wvw1968, wvw1969, wvw1970, wvw1971, wvw1972, wvw19770, wvw19771, wvw19772, wvw19773, wvw19774, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 15 > 11, 15 > 12, 15 > 13, 15 > 14, 15 > 15, 16 >= 16, 17 >= 17
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_elt105(wvw1587, wvw1588, wvw1589, wvw1590, wvw1591, wvw1592, wvw1593, wvw1594, wvw1595, wvw1596, wvw1597, wvw1598, Branch(wvw15990, wvw15991, wvw15992, wvw15993, wvw15994), h, ba) → new_glueBal2Mid_elt105(wvw1587, wvw1588, wvw1589, wvw1590, wvw1591, wvw1592, wvw1593, wvw1594, wvw15990, wvw15991, wvw15992, wvw15993, wvw15994, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_elt105(wvw1587, wvw1588, wvw1589, wvw1590, wvw1591, wvw1592, wvw1593, wvw1594, wvw1595, wvw1596, wvw1597, wvw1598, Branch(wvw15990, wvw15991, wvw15992, wvw15993, wvw15994), h, ba) → new_glueBal2Mid_elt105(wvw1587, wvw1588, wvw1589, wvw1590, wvw1591, wvw1592, wvw1593, wvw1594, wvw15990, wvw15991, wvw15992, wvw15993, wvw15994, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 13 > 9, 13 > 10, 13 > 11, 13 > 12, 13 > 13, 14 >= 14, 15 >= 15
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_key105(wvw1573, wvw1574, wvw1575, wvw1576, wvw1577, wvw1578, wvw1579, wvw1580, wvw1581, wvw1582, wvw1583, wvw1584, Branch(wvw15850, wvw15851, wvw15852, wvw15853, wvw15854), h, ba) → new_glueBal2Mid_key105(wvw1573, wvw1574, wvw1575, wvw1576, wvw1577, wvw1578, wvw1579, wvw1580, wvw15850, wvw15851, wvw15852, wvw15853, wvw15854, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_key105(wvw1573, wvw1574, wvw1575, wvw1576, wvw1577, wvw1578, wvw1579, wvw1580, wvw1581, wvw1582, wvw1583, wvw1584, Branch(wvw15850, wvw15851, wvw15852, wvw15853, wvw15854), h, ba) → new_glueBal2Mid_key105(wvw1573, wvw1574, wvw1575, wvw1576, wvw1577, wvw1578, wvw1579, wvw1580, wvw15850, wvw15851, wvw15852, wvw15853, wvw15854, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 13 > 9, 13 > 10, 13 > 11, 13 > 12, 13 > 13, 14 >= 14, 15 >= 15
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_elt201(wvw1380, wvw1381, wvw1382, wvw1383, wvw1384, wvw1385, wvw1386, wvw1387, wvw1388, wvw1389, wvw1390, wvw1391, Branch(wvw13920, wvw13921, wvw13922, wvw13923, wvw13924), wvw1393, h, ba) → new_glueBal2Mid_elt201(wvw1380, wvw1381, wvw1382, wvw1383, wvw1384, wvw1385, wvw1386, wvw1387, wvw1388, wvw13920, wvw13921, wvw13922, wvw13923, wvw13924, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_elt201(wvw1380, wvw1381, wvw1382, wvw1383, wvw1384, wvw1385, wvw1386, wvw1387, wvw1388, wvw1389, wvw1390, wvw1391, Branch(wvw13920, wvw13921, wvw13922, wvw13923, wvw13924), wvw1393, h, ba) → new_glueBal2Mid_elt201(wvw1380, wvw1381, wvw1382, wvw1383, wvw1384, wvw1385, wvw1386, wvw1387, wvw1388, wvw13920, wvw13921, wvw13922, wvw13923, wvw13924, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 13 > 10, 13 > 11, 13 > 12, 13 > 13, 13 > 14, 15 >= 15, 16 >= 16
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_key201(wvw1365, wvw1366, wvw1367, wvw1368, wvw1369, wvw1370, wvw1371, wvw1372, wvw1373, wvw1374, wvw1375, wvw1376, Branch(wvw13770, wvw13771, wvw13772, wvw13773, wvw13774), wvw1378, h, ba) → new_glueBal2Mid_key201(wvw1365, wvw1366, wvw1367, wvw1368, wvw1369, wvw1370, wvw1371, wvw1372, wvw1373, wvw13770, wvw13771, wvw13772, wvw13773, wvw13774, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_key201(wvw1365, wvw1366, wvw1367, wvw1368, wvw1369, wvw1370, wvw1371, wvw1372, wvw1373, wvw1374, wvw1375, wvw1376, Branch(wvw13770, wvw13771, wvw13772, wvw13773, wvw13774), wvw1378, h, ba) → new_glueBal2Mid_key201(wvw1365, wvw1366, wvw1367, wvw1368, wvw1369, wvw1370, wvw1371, wvw1372, wvw1373, wvw13770, wvw13771, wvw13772, wvw13773, wvw13774, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 13 > 10, 13 > 11, 13 > 12, 13 > 13, 13 > 14, 15 >= 15, 16 >= 16
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_elt106(wvw1559, wvw1560, wvw1561, wvw1562, wvw1563, wvw1564, wvw1565, wvw1566, wvw1567, wvw1568, wvw1569, wvw1570, Branch(wvw15710, wvw15711, wvw15712, wvw15713, wvw15714), h, ba) → new_glueBal2Mid_elt106(wvw1559, wvw1560, wvw1561, wvw1562, wvw1563, wvw1564, wvw1565, wvw1566, wvw15710, wvw15711, wvw15712, wvw15713, wvw15714, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_elt106(wvw1559, wvw1560, wvw1561, wvw1562, wvw1563, wvw1564, wvw1565, wvw1566, wvw1567, wvw1568, wvw1569, wvw1570, Branch(wvw15710, wvw15711, wvw15712, wvw15713, wvw15714), h, ba) → new_glueBal2Mid_elt106(wvw1559, wvw1560, wvw1561, wvw1562, wvw1563, wvw1564, wvw1565, wvw1566, wvw15710, wvw15711, wvw15712, wvw15713, wvw15714, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 13 > 9, 13 > 10, 13 > 11, 13 > 12, 13 > 13, 14 >= 14, 15 >= 15
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_key106(wvw1545, wvw1546, wvw1547, wvw1548, wvw1549, wvw1550, wvw1551, wvw1552, wvw1553, wvw1554, wvw1555, wvw1556, Branch(wvw15570, wvw15571, wvw15572, wvw15573, wvw15574), h, ba) → new_glueBal2Mid_key106(wvw1545, wvw1546, wvw1547, wvw1548, wvw1549, wvw1550, wvw1551, wvw1552, wvw15570, wvw15571, wvw15572, wvw15573, wvw15574, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_key106(wvw1545, wvw1546, wvw1547, wvw1548, wvw1549, wvw1550, wvw1551, wvw1552, wvw1553, wvw1554, wvw1555, wvw1556, Branch(wvw15570, wvw15571, wvw15572, wvw15573, wvw15574), h, ba) → new_glueBal2Mid_key106(wvw1545, wvw1546, wvw1547, wvw1548, wvw1549, wvw1550, wvw1551, wvw1552, wvw15570, wvw15571, wvw15572, wvw15573, wvw15574, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 13 > 9, 13 > 10, 13 > 11, 13 > 12, 13 > 13, 14 >= 14, 15 >= 15
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_elt107(wvw1725, wvw1726, wvw1727, wvw1728, wvw1729, wvw1730, wvw1731, wvw1732, wvw1733, wvw1734, wvw1735, wvw1736, wvw1737, Branch(wvw17380, wvw17381, wvw17382, wvw17383, wvw17384), h, ba) → new_glueBal2Mid_elt107(wvw1725, wvw1726, wvw1727, wvw1728, wvw1729, wvw1730, wvw1731, wvw1732, wvw1733, wvw17380, wvw17381, wvw17382, wvw17383, wvw17384, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_elt107(wvw1725, wvw1726, wvw1727, wvw1728, wvw1729, wvw1730, wvw1731, wvw1732, wvw1733, wvw1734, wvw1735, wvw1736, wvw1737, Branch(wvw17380, wvw17381, wvw17382, wvw17383, wvw17384), h, ba) → new_glueBal2Mid_elt107(wvw1725, wvw1726, wvw1727, wvw1728, wvw1729, wvw1730, wvw1731, wvw1732, wvw1733, wvw17380, wvw17381, wvw17382, wvw17383, wvw17384, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 14 > 10, 14 > 11, 14 > 12, 14 > 13, 14 > 14, 15 >= 15, 16 >= 16
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_key107(wvw1710, wvw1711, wvw1712, wvw1713, wvw1714, wvw1715, wvw1716, wvw1717, wvw1718, wvw1719, wvw1720, wvw1721, wvw1722, Branch(wvw17230, wvw17231, wvw17232, wvw17233, wvw17234), h, ba) → new_glueBal2Mid_key107(wvw1710, wvw1711, wvw1712, wvw1713, wvw1714, wvw1715, wvw1716, wvw1717, wvw1718, wvw17230, wvw17231, wvw17232, wvw17233, wvw17234, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_key107(wvw1710, wvw1711, wvw1712, wvw1713, wvw1714, wvw1715, wvw1716, wvw1717, wvw1718, wvw1719, wvw1720, wvw1721, wvw1722, Branch(wvw17230, wvw17231, wvw17232, wvw17233, wvw17234), h, ba) → new_glueBal2Mid_key107(wvw1710, wvw1711, wvw1712, wvw1713, wvw1714, wvw1715, wvw1716, wvw1717, wvw1718, wvw17230, wvw17231, wvw17232, wvw17233, wvw17234, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 14 > 10, 14 > 11, 14 > 12, 14 > 13, 14 > 14, 15 >= 15, 16 >= 16
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_elt202(wvw1341, wvw1342, wvw1343, wvw1344, wvw1345, wvw1346, wvw1347, wvw1348, wvw1349, wvw1350, wvw1351, wvw1352, wvw1353, Branch(wvw13540, wvw13541, wvw13542, wvw13543, wvw13544), wvw1355, h, ba) → new_glueBal2Mid_elt202(wvw1341, wvw1342, wvw1343, wvw1344, wvw1345, wvw1346, wvw1347, wvw1348, wvw1349, wvw1350, wvw13540, wvw13541, wvw13542, wvw13543, wvw13544, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_elt202(wvw1341, wvw1342, wvw1343, wvw1344, wvw1345, wvw1346, wvw1347, wvw1348, wvw1349, wvw1350, wvw1351, wvw1352, wvw1353, Branch(wvw13540, wvw13541, wvw13542, wvw13543, wvw13544), wvw1355, h, ba) → new_glueBal2Mid_elt202(wvw1341, wvw1342, wvw1343, wvw1344, wvw1345, wvw1346, wvw1347, wvw1348, wvw1349, wvw1350, wvw13540, wvw13541, wvw13542, wvw13543, wvw13544, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 14 > 11, 14 > 12, 14 > 13, 14 > 14, 14 > 15, 16 >= 16, 17 >= 17
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_key202(wvw1317, wvw1318, wvw1319, wvw1320, wvw1321, wvw1322, wvw1323, wvw1324, wvw1325, wvw1326, wvw1327, wvw1328, wvw1329, Branch(wvw13300, wvw13301, wvw13302, wvw13303, wvw13304), wvw1331, h, ba) → new_glueBal2Mid_key202(wvw1317, wvw1318, wvw1319, wvw1320, wvw1321, wvw1322, wvw1323, wvw1324, wvw1325, wvw1326, wvw13300, wvw13301, wvw13302, wvw13303, wvw13304, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_key202(wvw1317, wvw1318, wvw1319, wvw1320, wvw1321, wvw1322, wvw1323, wvw1324, wvw1325, wvw1326, wvw1327, wvw1328, wvw1329, Branch(wvw13300, wvw13301, wvw13302, wvw13303, wvw13304), wvw1331, h, ba) → new_glueBal2Mid_key202(wvw1317, wvw1318, wvw1319, wvw1320, wvw1321, wvw1322, wvw1323, wvw1324, wvw1325, wvw1326, wvw13300, wvw13301, wvw13302, wvw13303, wvw13304, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 14 > 11, 14 > 12, 14 > 13, 14 > 14, 14 > 15, 16 >= 16, 17 >= 17
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_elt203(wvw1458, wvw1459, wvw1460, wvw1461, wvw1462, wvw1463, wvw1464, wvw1465, wvw1466, wvw1467, wvw1468, wvw1469, Branch(wvw14700, wvw14701, wvw14702, wvw14703, wvw14704), wvw1471, h, ba) → new_glueBal2Mid_elt203(wvw1458, wvw1459, wvw1460, wvw1461, wvw1462, wvw1463, wvw1464, wvw1465, wvw1466, wvw14700, wvw14701, wvw14702, wvw14703, wvw14704, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_elt203(wvw1458, wvw1459, wvw1460, wvw1461, wvw1462, wvw1463, wvw1464, wvw1465, wvw1466, wvw1467, wvw1468, wvw1469, Branch(wvw14700, wvw14701, wvw14702, wvw14703, wvw14704), wvw1471, h, ba) → new_glueBal2Mid_elt203(wvw1458, wvw1459, wvw1460, wvw1461, wvw1462, wvw1463, wvw1464, wvw1465, wvw1466, wvw14700, wvw14701, wvw14702, wvw14703, wvw14704, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 13 > 10, 13 > 11, 13 > 12, 13 > 13, 13 > 14, 15 >= 15, 16 >= 16
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_key203(wvw1443, wvw1444, wvw1445, wvw1446, wvw1447, wvw1448, wvw1449, wvw1450, wvw1451, wvw1452, wvw1453, wvw1454, Branch(wvw14550, wvw14551, wvw14552, wvw14553, wvw14554), wvw1456, h, ba) → new_glueBal2Mid_key203(wvw1443, wvw1444, wvw1445, wvw1446, wvw1447, wvw1448, wvw1449, wvw1450, wvw1451, wvw14550, wvw14551, wvw14552, wvw14553, wvw14554, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_key203(wvw1443, wvw1444, wvw1445, wvw1446, wvw1447, wvw1448, wvw1449, wvw1450, wvw1451, wvw1452, wvw1453, wvw1454, Branch(wvw14550, wvw14551, wvw14552, wvw14553, wvw14554), wvw1456, h, ba) → new_glueBal2Mid_key203(wvw1443, wvw1444, wvw1445, wvw1446, wvw1447, wvw1448, wvw1449, wvw1450, wvw1451, wvw14550, wvw14551, wvw14552, wvw14553, wvw14554, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 13 > 10, 13 > 11, 13 > 12, 13 > 13, 13 > 14, 15 >= 15, 16 >= 16
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_elt108(wvw2411, wvw2412, wvw2413, wvw2414, wvw2415, wvw2416, wvw2417, wvw2418, wvw2419, wvw2420, wvw2421, wvw2422, wvw2423, wvw2424, Branch(wvw24250, wvw24251, wvw24252, wvw24253, wvw24254), h, ba) → new_glueBal2Mid_elt108(wvw2411, wvw2412, wvw2413, wvw2414, wvw2415, wvw2416, wvw2417, wvw2418, wvw2419, wvw2420, wvw24250, wvw24251, wvw24252, wvw24253, wvw24254, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_elt108(wvw2411, wvw2412, wvw2413, wvw2414, wvw2415, wvw2416, wvw2417, wvw2418, wvw2419, wvw2420, wvw2421, wvw2422, wvw2423, wvw2424, Branch(wvw24250, wvw24251, wvw24252, wvw24253, wvw24254), h, ba) → new_glueBal2Mid_elt108(wvw2411, wvw2412, wvw2413, wvw2414, wvw2415, wvw2416, wvw2417, wvw2418, wvw2419, wvw2420, wvw24250, wvw24251, wvw24252, wvw24253, wvw24254, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 15 > 11, 15 > 12, 15 > 13, 15 > 14, 15 > 15, 16 >= 16, 17 >= 17
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_key108(wvw2395, wvw2396, wvw2397, wvw2398, wvw2399, wvw2400, wvw2401, wvw2402, wvw2403, wvw2404, wvw2405, wvw2406, wvw2407, wvw2408, Branch(wvw24090, wvw24091, wvw24092, wvw24093, wvw24094), h, ba) → new_glueBal2Mid_key108(wvw2395, wvw2396, wvw2397, wvw2398, wvw2399, wvw2400, wvw2401, wvw2402, wvw2403, wvw2404, wvw24090, wvw24091, wvw24092, wvw24093, wvw24094, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_key108(wvw2395, wvw2396, wvw2397, wvw2398, wvw2399, wvw2400, wvw2401, wvw2402, wvw2403, wvw2404, wvw2405, wvw2406, wvw2407, wvw2408, Branch(wvw24090, wvw24091, wvw24092, wvw24093, wvw24094), h, ba) → new_glueBal2Mid_key108(wvw2395, wvw2396, wvw2397, wvw2398, wvw2399, wvw2400, wvw2401, wvw2402, wvw2403, wvw2404, wvw24090, wvw24091, wvw24092, wvw24093, wvw24094, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 15 > 11, 15 > 12, 15 > 13, 15 > 14, 15 > 15, 16 >= 16, 17 >= 17
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_elt204(wvw2317, wvw2318, wvw2319, wvw2320, wvw2321, wvw2322, wvw2323, wvw2324, wvw2325, wvw2326, wvw2327, wvw2328, wvw2329, Branch(wvw23300, wvw23301, wvw23302, wvw23303, wvw23304), wvw2331, h, ba) → new_glueBal2Mid_elt204(wvw2317, wvw2318, wvw2319, wvw2320, wvw2321, wvw2322, wvw2323, wvw2324, wvw2325, wvw2326, wvw23300, wvw23301, wvw23302, wvw23303, wvw23304, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_elt204(wvw2317, wvw2318, wvw2319, wvw2320, wvw2321, wvw2322, wvw2323, wvw2324, wvw2325, wvw2326, wvw2327, wvw2328, wvw2329, Branch(wvw23300, wvw23301, wvw23302, wvw23303, wvw23304), wvw2331, h, ba) → new_glueBal2Mid_elt204(wvw2317, wvw2318, wvw2319, wvw2320, wvw2321, wvw2322, wvw2323, wvw2324, wvw2325, wvw2326, wvw23300, wvw23301, wvw23302, wvw23303, wvw23304, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 14 > 11, 14 > 12, 14 > 13, 14 > 14, 14 > 15, 16 >= 16, 17 >= 17
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2Mid_key204(wvw2301, wvw2302, wvw2303, wvw2304, wvw2305, wvw2306, wvw2307, wvw2308, wvw2309, wvw2310, wvw2311, wvw2312, wvw2313, Branch(wvw23140, wvw23141, wvw23142, wvw23143, wvw23144), wvw2315, h, ba) → new_glueBal2Mid_key204(wvw2301, wvw2302, wvw2303, wvw2304, wvw2305, wvw2306, wvw2307, wvw2308, wvw2309, wvw2310, wvw23140, wvw23141, wvw23142, wvw23143, wvw23144, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2Mid_key204(wvw2301, wvw2302, wvw2303, wvw2304, wvw2305, wvw2306, wvw2307, wvw2308, wvw2309, wvw2310, wvw2311, wvw2312, wvw2313, Branch(wvw23140, wvw23141, wvw23142, wvw23143, wvw23144), wvw2315, h, ba) → new_glueBal2Mid_key204(wvw2301, wvw2302, wvw2303, wvw2304, wvw2305, wvw2306, wvw2307, wvw2308, wvw2309, wvw2310, wvw23140, wvw23141, wvw23142, wvw23143, wvw23144, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 14 > 11, 14 > 12, 14 > 13, 14 > 14, 14 > 15, 16 >= 16, 17 >= 17
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_primMinusNat(Succ(wvw12860), Succ(wvw128900)) → new_primMinusNat(wvw12860, wvw128900)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_primMinusNat(Succ(wvw12860), Succ(wvw128900)) → new_primMinusNat(wvw12860, wvw128900)
The graph contains the following edges 1 > 1, 2 > 2
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_primPlusNat(Succ(wvw1252000), Succ(wvw1260000)) → new_primPlusNat(wvw1252000, wvw1260000)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_primPlusNat(Succ(wvw1252000), Succ(wvw1260000)) → new_primPlusNat(wvw1252000, wvw1260000)
The graph contains the following edges 1 > 1, 2 > 2
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch11(wvw2164, wvw2165, wvw2166, wvw2167, wvw2168, wvw2230, wvw2229, wvw2202, wvw2201, Succ(wvw2500000), Succ(wvw251000), h, ba) → new_mkBalBranch6MkBalBranch11(wvw2164, wvw2165, wvw2166, wvw2167, wvw2168, wvw2230, wvw2229, wvw2202, wvw2201, wvw2500000, wvw251000, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch11(wvw2164, wvw2165, wvw2166, wvw2167, wvw2168, wvw2230, wvw2229, wvw2202, wvw2201, Succ(wvw2500000), Succ(wvw251000), h, ba) → new_mkBalBranch6MkBalBranch11(wvw2164, wvw2165, wvw2166, wvw2167, wvw2168, wvw2230, wvw2229, wvw2202, wvw2201, wvw2500000, wvw251000, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 > 10, 11 > 11, 12 >= 12, 13 >= 13
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch3(wvw2164, wvw2165, wvw2166, wvw2167, wvw2168, wvw2230, wvw2229, wvw2202, wvw2228, wvw2227, wvw2201, Succ(wvw2444000), Succ(wvw247400), h, ba) → new_mkBalBranch6MkBalBranch3(wvw2164, wvw2165, wvw2166, wvw2167, wvw2168, wvw2230, wvw2229, wvw2202, wvw2228, wvw2227, wvw2201, wvw2444000, wvw247400, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch3(wvw2164, wvw2165, wvw2166, wvw2167, wvw2168, wvw2230, wvw2229, wvw2202, wvw2228, wvw2227, wvw2201, Succ(wvw2444000), Succ(wvw247400), h, ba) → new_mkBalBranch6MkBalBranch3(wvw2164, wvw2165, wvw2166, wvw2167, wvw2168, wvw2230, wvw2229, wvw2202, wvw2228, wvw2227, wvw2201, wvw2444000, wvw247400, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 11 >= 11, 12 > 12, 13 > 13, 14 >= 14, 15 >= 15
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch01(wvw2164, wvw2165, wvw2166, wvw2167, wvw2168, wvw2230, wvw2229, wvw2202, wvw22010, wvw22011, wvw22012, wvw22013, wvw22014, Succ(wvw2464000), Succ(wvw249000), h, ba) → new_mkBalBranch6MkBalBranch01(wvw2164, wvw2165, wvw2166, wvw2167, wvw2168, wvw2230, wvw2229, wvw2202, wvw22010, wvw22011, wvw22012, wvw22013, wvw22014, wvw2464000, wvw249000, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch01(wvw2164, wvw2165, wvw2166, wvw2167, wvw2168, wvw2230, wvw2229, wvw2202, wvw22010, wvw22011, wvw22012, wvw22013, wvw22014, Succ(wvw2464000), Succ(wvw249000), h, ba) → new_mkBalBranch6MkBalBranch01(wvw2164, wvw2165, wvw2166, wvw2167, wvw2168, wvw2230, wvw2229, wvw2202, wvw22010, wvw22011, wvw22012, wvw22013, wvw22014, wvw2464000, wvw249000, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 11 >= 11, 12 >= 12, 13 >= 13, 14 > 14, 15 > 15, 16 >= 16, 17 >= 17
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch4(wvw2164, wvw2165, wvw2166, wvw2167, wvw2168, wvw2230, wvw2229, wvw2202, wvw2228, wvw2227, wvw2201, Succ(wvw2243000), Succ(wvw242600), h, ba) → new_mkBalBranch6MkBalBranch4(wvw2164, wvw2165, wvw2166, wvw2167, wvw2168, wvw2230, wvw2229, wvw2202, wvw2228, wvw2227, wvw2201, wvw2243000, wvw242600, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch4(wvw2164, wvw2165, wvw2166, wvw2167, wvw2168, wvw2230, wvw2229, wvw2202, wvw2228, wvw2227, wvw2201, Succ(wvw2243000), Succ(wvw242600), h, ba) → new_mkBalBranch6MkBalBranch4(wvw2164, wvw2165, wvw2166, wvw2167, wvw2168, wvw2230, wvw2229, wvw2202, wvw2228, wvw2227, wvw2201, wvw2243000, wvw242600, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 11 >= 11, 12 > 12, 13 > 13, 14 >= 14, 15 >= 15
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch110(wvw2147, wvw2148, wvw2149, wvw2150, wvw2151, wvw2240, wvw2239, wvw2196, wvw2195, Succ(wvw2498000), Succ(wvw250200), h, ba) → new_mkBalBranch6MkBalBranch110(wvw2147, wvw2148, wvw2149, wvw2150, wvw2151, wvw2240, wvw2239, wvw2196, wvw2195, wvw2498000, wvw250200, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch110(wvw2147, wvw2148, wvw2149, wvw2150, wvw2151, wvw2240, wvw2239, wvw2196, wvw2195, Succ(wvw2498000), Succ(wvw250200), h, ba) → new_mkBalBranch6MkBalBranch110(wvw2147, wvw2148, wvw2149, wvw2150, wvw2151, wvw2240, wvw2239, wvw2196, wvw2195, wvw2498000, wvw250200, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 > 10, 11 > 11, 12 >= 12, 13 >= 13
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch30(wvw2147, wvw2148, wvw2149, wvw2150, wvw2151, wvw2240, wvw2239, wvw2196, wvw2238, wvw2237, wvw2195, Succ(wvw2442000), Succ(wvw246600), h, ba) → new_mkBalBranch6MkBalBranch30(wvw2147, wvw2148, wvw2149, wvw2150, wvw2151, wvw2240, wvw2239, wvw2196, wvw2238, wvw2237, wvw2195, wvw2442000, wvw246600, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch30(wvw2147, wvw2148, wvw2149, wvw2150, wvw2151, wvw2240, wvw2239, wvw2196, wvw2238, wvw2237, wvw2195, Succ(wvw2442000), Succ(wvw246600), h, ba) → new_mkBalBranch6MkBalBranch30(wvw2147, wvw2148, wvw2149, wvw2150, wvw2151, wvw2240, wvw2239, wvw2196, wvw2238, wvw2237, wvw2195, wvw2442000, wvw246600, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 11 >= 11, 12 > 12, 13 > 13, 14 >= 14, 15 >= 15
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch010(wvw2147, wvw2148, wvw2149, wvw2150, wvw2151, wvw2240, wvw2239, wvw2196, wvw21950, wvw21951, wvw21952, wvw21953, wvw21954, Succ(wvw2454000), Succ(wvw248200), h, ba) → new_mkBalBranch6MkBalBranch010(wvw2147, wvw2148, wvw2149, wvw2150, wvw2151, wvw2240, wvw2239, wvw2196, wvw21950, wvw21951, wvw21952, wvw21953, wvw21954, wvw2454000, wvw248200, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch010(wvw2147, wvw2148, wvw2149, wvw2150, wvw2151, wvw2240, wvw2239, wvw2196, wvw21950, wvw21951, wvw21952, wvw21953, wvw21954, Succ(wvw2454000), Succ(wvw248200), h, ba) → new_mkBalBranch6MkBalBranch010(wvw2147, wvw2148, wvw2149, wvw2150, wvw2151, wvw2240, wvw2239, wvw2196, wvw21950, wvw21951, wvw21952, wvw21953, wvw21954, wvw2454000, wvw248200, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 11 >= 11, 12 >= 12, 13 >= 13, 14 > 14, 15 > 15, 16 >= 16, 17 >= 17
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch40(wvw2147, wvw2148, wvw2149, wvw2150, wvw2151, wvw2240, wvw2239, wvw2196, wvw2238, wvw2237, wvw2195, Succ(wvw2244000), Succ(wvw236400), h, ba) → new_mkBalBranch6MkBalBranch40(wvw2147, wvw2148, wvw2149, wvw2150, wvw2151, wvw2240, wvw2239, wvw2196, wvw2238, wvw2237, wvw2195, wvw2244000, wvw236400, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch40(wvw2147, wvw2148, wvw2149, wvw2150, wvw2151, wvw2240, wvw2239, wvw2196, wvw2238, wvw2237, wvw2195, Succ(wvw2244000), Succ(wvw236400), h, ba) → new_mkBalBranch6MkBalBranch40(wvw2147, wvw2148, wvw2149, wvw2150, wvw2151, wvw2240, wvw2239, wvw2196, wvw2238, wvw2237, wvw2195, wvw2244000, wvw236400, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 11 >= 11, 12 > 12, 13 > 13, 14 >= 14, 15 >= 15
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch111(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Succ(wvw2390000), Succ(wvw244600), h, ba) → new_mkBalBranch6MkBalBranch111(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw2390000, wvw244600, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch111(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Succ(wvw2390000), Succ(wvw244600), h, ba) → new_mkBalBranch6MkBalBranch111(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw2390000, wvw244600, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 > 10, 11 > 11, 12 >= 12, 13 >= 13
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch31(wvw1834, wvw1835, wvw1836, wvw1837, wvw1838, wvw1839, wvw1840, wvw1841, wvw1842, wvw1843, wvw1844, Succ(wvw2296000), Succ(wvw245600), h, ba) → new_mkBalBranch6MkBalBranch31(wvw1834, wvw1835, wvw1836, wvw1837, wvw1838, wvw1839, wvw1840, wvw1841, wvw1842, wvw1843, wvw1844, wvw2296000, wvw245600, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch31(wvw1834, wvw1835, wvw1836, wvw1837, wvw1838, wvw1839, wvw1840, wvw1841, wvw1842, wvw1843, wvw1844, Succ(wvw2296000), Succ(wvw245600), h, ba) → new_mkBalBranch6MkBalBranch31(wvw1834, wvw1835, wvw1836, wvw1837, wvw1838, wvw1839, wvw1840, wvw1841, wvw1842, wvw1843, wvw1844, wvw2296000, wvw245600, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 11 >= 11, 12 > 12, 13 > 13, 14 >= 14, 15 >= 15
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch32(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw2294000), Succ(wvw236500), h, ba) → new_mkBalBranch6MkBalBranch32(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw2294000, wvw236500, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch32(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw2294000), Succ(wvw236500), h, ba) → new_mkBalBranch6MkBalBranch32(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw2294000, wvw236500, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 > 6, 7 > 7, 8 >= 8, 9 >= 9
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch011(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Succ(wvw2298000), Succ(wvw238400), h, ba) → new_mkBalBranch6MkBalBranch011(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, wvw2298000, wvw238400, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch011(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Succ(wvw2298000), Succ(wvw238400), h, ba) → new_mkBalBranch6MkBalBranch011(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, wvw2298000, wvw238400, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 > 10, 11 > 11, 12 >= 12, 13 >= 13
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch41(wvw1834, wvw1835, wvw1836, wvw1837, wvw1838, wvw1839, wvw1840, wvw1841, wvw1842, wvw1843, wvw1844, Succ(wvw2008000), Succ(wvw219100), h, ba) → new_mkBalBranch6MkBalBranch41(wvw1834, wvw1835, wvw1836, wvw1837, wvw1838, wvw1839, wvw1840, wvw1841, wvw1842, wvw1843, wvw1844, wvw2008000, wvw219100, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch41(wvw1834, wvw1835, wvw1836, wvw1837, wvw1838, wvw1839, wvw1840, wvw1841, wvw1842, wvw1843, wvw1844, Succ(wvw2008000), Succ(wvw219100), h, ba) → new_mkBalBranch6MkBalBranch41(wvw1834, wvw1835, wvw1836, wvw1837, wvw1838, wvw1839, wvw1840, wvw1841, wvw1842, wvw1843, wvw1844, wvw2008000, wvw219100, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 11 >= 11, 12 > 12, 13 > 13, 14 >= 14, 15 >= 15
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch42(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw2242000), Succ(wvw228200), h, ba) → new_mkBalBranch6MkBalBranch42(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw2242000, wvw228200, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch42(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw2242000), Succ(wvw228200), h, ba) → new_mkBalBranch6MkBalBranch42(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw2242000, wvw228200, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 > 6, 7 > 7, 8 >= 8, 9 >= 9
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_deleteMax(wvw21680, wvw21681, wvw21682, wvw21683, Branch(wvw216840, wvw216841, wvw216842, wvw216843, wvw216844), h, ba) → new_mkBalBranch(wvw21680, wvw21681, wvw21683, wvw216840, wvw216841, wvw216842, wvw216843, wvw216844, h, ba)
new_mkBalBranch6MkBalBranch5(wvw2167, wvw2164, wvw2165, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, Neg(Succ(wvw221600)), h, ba) → new_deleteMax(wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, h, ba)
new_mkBalBranch6MkBalBranch50(wvw2167, wvw2164, wvw2165, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, h, ba) → new_deleteMax(wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, h, ba)
new_mkBalBranch6MkBalBranch5(wvw2167, wvw2164, wvw2165, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, Pos(Zero), h, ba) → new_mkBalBranch6MkBalBranch50(wvw2167, wvw2164, wvw2165, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, h, ba)
new_mkBalBranch6MkBalBranch5(wvw2167, wvw2164, wvw2165, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, Neg(Zero), h, ba) → new_mkBalBranch6MkBalBranch50(wvw2167, wvw2164, wvw2165, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, h, ba)
new_mkBalBranch(wvw2164, wvw2165, wvw2167, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, h, ba) → new_mkBalBranch6MkBalBranch5(wvw2167, wvw2164, wvw2165, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, new_ps(new_sizeFM(wvw2167, h, ba), new_sizeFM(new_deleteMax0(wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, h, ba), h, ba)), h, ba)
new_mkBalBranch(wvw2164, wvw2165, wvw2167, wvw21680, wvw21681, wvw21682, wvw21683, Branch(wvw216840, wvw216841, wvw216842, wvw216843, wvw216844), h, ba) → new_mkBalBranch(wvw21680, wvw21681, wvw21683, wvw216840, wvw216841, wvw216842, wvw216843, wvw216844, h, ba)
new_mkBalBranch6MkBalBranch5(wvw2167, wvw2164, wvw2165, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, Pos(Succ(Zero)), h, ba) → new_mkBalBranch6MkBalBranch50(wvw2167, wvw2164, wvw2165, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, h, ba)
new_mkBalBranch6MkBalBranch5(wvw2167, wvw2164, wvw2165, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, Pos(Succ(Succ(wvw2216000))), h, ba) → new_deleteMax(wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, h, ba)
The TRS R consists of the following rules:
new_mkBalBranch6MkBalBranch1113(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw239000, Succ(wvw24460), bb, bc) → new_mkBalBranch6MkBalBranch1110(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw239000, wvw24460, bb, bc)
new_mkBalBranch6MkBalBranch43(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, wvw2287, bb, bc) → new_mkBalBranch6MkBalBranch44(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw2287, wvw224200, bb, bc)
new_mkBalBranch6MkBalBranch412(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, bb, bc) → new_mkBalBranch6MkBalBranch45(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_mkBranch(wvw2435, wvw2436, wvw2437, wvw2438, wvw2439, bd, be) → Branch(wvw2436, wvw2437, new_mkBranchUnbox(wvw2438, wvw2436, wvw2439, new_ps(new_ps(Pos(Succ(Zero)), new_sizeFM(wvw2438, bd, be)), new_sizeFM(wvw2439, bd, be)), bd, be), wvw2438, wvw2439)
new_mkBalBranch6MkBalBranch015(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Neg(Zero), Pos(wvw22990), bb, bc) → new_mkBalBranch6MkBalBranch0111(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, new_primMulNat(wvw22990), bb, bc)
new_primMulNat(Zero) → Zero
new_mkBalBranch6MkBalBranch49(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw2242000), Succ(wvw228200), bb, bc) → new_mkBalBranch6MkBalBranch49(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw2242000, wvw228200, bb, bc)
new_mkBalBranch6MkBalBranch0(wvw2225, wvw2152, wvw2153, Branch(wvw21560, wvw21561, wvw21562, wvw21563, wvw21564), wvw2224, bb, bc) → new_mkBalBranch6MkBalBranch015(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, new_sizeFM(wvw21563, bb, bc), new_sizeFM(wvw21564, bb, bc), bb, bc)
new_mkBalBranch6MkBalBranch015(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Pos(Succ(wvw229800)), Neg(wvw22990), bb, bc) → new_mkBalBranch6MkBalBranch014(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch1116(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Zero, bb, bc) → new_mkBalBranch6MkBalBranch114(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, bb, bc)
new_mkBalBranch6MkBalBranch1111(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Neg(Zero), Pos(wvw23910), bb, bc) → new_mkBalBranch6MkBalBranch1114(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, new_primMulNat(wvw23910), bb, bc)
new_mkBalBranch6MkBalBranch52(wvw2167, wvw2164, wvw2165, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, Neg(Succ(wvw221600)), h, ba) → new_mkBalBranch6MkBalBranch51(wvw2167, wvw2164, wvw2165, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, h, ba)
new_mkBalBranch6MkBalBranch312(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Pos(Zero), Pos(wvw22950), bb, bc) → new_mkBalBranch6MkBalBranch315(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, new_primMulNat1(wvw22950), bb, bc)
new_mkBalBranch6MkBalBranch52(wvw2167, wvw2164, wvw2165, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, Pos(Zero), h, ba) → new_mkBalBranch6MkBalBranch51(wvw2167, wvw2164, wvw2165, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, h, ba)
new_mkBalBranch6MkBalBranch313(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw229400, wvw2365, bb, bc) → new_mkBalBranch6MkBalBranch34(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw229400, wvw2365, bb, bc)
new_mkBalBranch6MkBalBranch312(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Neg(Zero), Pos(wvw22950), bb, bc) → new_mkBalBranch6MkBalBranch311(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, new_primMulNat1(wvw22950), bb, bc)
new_mkBalBranch6MkBalBranch115(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, EmptyFM, bb, bc) → error([])
new_primPlusInt(Neg(wvw18930), Pos(wvw18920)) → new_primMinusNat0(wvw18920, wvw18930)
new_primPlusInt(Pos(wvw18930), Neg(wvw18920)) → new_primMinusNat0(wvw18930, wvw18920)
new_mkBalBranch6MkBalBranch310(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw229400, wvw2369, bb, bc) → new_mkBalBranch6MkBalBranch36(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch017(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Zero, bb, bc) → new_mkBalBranch6MkBalBranch012(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch52(wvw2167, wvw2164, wvw2165, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, Pos(Succ(Zero)), h, ba) → new_mkBalBranch6MkBalBranch51(wvw2167, wvw2164, wvw2165, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, h, ba)
new_mkBalBranch6MkBalBranch417(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Pos(Zero), bb, bc) → new_mkBalBranch6MkBalBranch411(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, new_mkBalBranch6Size_l(wvw2225, wvw2152, wvw2153, wvw2156, bb, bc), bb, bc)
new_mkBalBranch6MkBalBranch53(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, bb, bc) → new_mkBalBranch6MkBalBranch54(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch39(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, wvw229400, bb, bc) → new_mkBalBranch6MkBalBranch36(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch49(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw2242000), Zero, bb, bc) → new_mkBalBranch6MkBalBranch416(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_deleteMax0(wvw21680, wvw21681, wvw21682, wvw21683, Branch(wvw216840, wvw216841, wvw216842, wvw216843, wvw216844), h, ba) → new_mkBalBranch0(wvw21680, wvw21681, wvw21683, wvw216840, wvw216841, wvw216842, wvw216843, wvw216844, h, ba)
new_mkBalBranch6MkBalBranch312(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Pos(Zero), Neg(wvw22950), bb, bc) → new_mkBalBranch6MkBalBranch316(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, new_primMulNat1(wvw22950), bb, bc)
new_mkBalBranch6MkBalBranch411(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Neg(wvw22780), bb, bc) → new_mkBalBranch6MkBalBranch413(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, new_primMulNat1(wvw22780), bb, bc)
new_mkBalBranch6MkBalBranch315(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, bb, bc) → new_mkBalBranch6MkBalBranch37(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch119(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, bb, bc) → new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero))))))), wvw22240, wvw22241, wvw22243, new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero)))))))), wvw2152, wvw2153, wvw22244, wvw2156, bb, bc), bb, bc)
new_mkBalBranch6MkBalBranch420(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, wvw2282, bb, bc) → new_mkBalBranch6MkBalBranch48(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, wvw2282, bb, bc)
new_mkBalBranch6MkBalBranch0113(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Succ(wvw2298000), Zero, bb, bc) → new_mkBalBranch6MkBalBranch014(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch018(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Succ(wvw23780), bb, bc) → new_mkBalBranch6MkBalBranch014(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch414(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, Neg(wvw22790), bb, bc) → new_mkBalBranch6MkBalBranch43(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, new_primMulNat1(wvw22790), bb, bc)
new_mkBalBranch6MkBalBranch0113(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Succ(wvw2298000), Succ(wvw238400), bb, bc) → new_mkBalBranch6MkBalBranch0113(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, wvw2298000, wvw238400, bb, bc)
new_mkBranchUnbox(wvw2438, wvw2436, wvw2439, wvw2440, bd, be) → wvw2440
new_mkBalBranch6MkBalBranch38(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw229400, wvw2370, bb, bc) → new_mkBalBranch6MkBalBranch39(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw2370, wvw229400, bb, bc)
new_mkBalBranch6MkBalBranch1116(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Succ(wvw24480), bb, bc) → new_mkBalBranch6MkBalBranch118(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Zero, wvw24480, bb, bc)
new_mkBalBranch6MkBalBranch418(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, Neg(wvw22770), bb, bc) → new_mkBalBranch6MkBalBranch422(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, new_primMulNat1(wvw22770), bb, bc)
new_mkBalBranch6MkBalBranch1(wvw2225, wvw2152, wvw2153, wvw2156, EmptyFM, bb, bc) → error([])
new_mkBalBranch6MkBalBranch316(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw23680), bb, bc) → new_mkBalBranch6MkBalBranch33(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch1112(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw239000, wvw2446, bb, bc) → new_mkBalBranch6MkBalBranch1113(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw239000, wvw2446, bb, bc)
new_mkBalBranch6MkBalBranch316(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, bb, bc) → new_mkBalBranch6MkBalBranch37(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch1115(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw239000, wvw2450, bb, bc) → new_mkBalBranch6MkBalBranch119(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, bb, bc)
new_mkBalBranch6MkBalBranch112(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Succ(wvw24490), bb, bc) → new_mkBalBranch6MkBalBranch113(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, bb, bc)
new_mkBalBranch6MkBalBranch116(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw239000, wvw2447, bb, bc) → new_mkBalBranch6MkBalBranch113(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, bb, bc)
new_mkBalBranch6MkBalBranch416(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc) → new_mkBalBranch6MkBalBranch0(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch317(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, bb, bc) → new_mkBalBranch6MkBalBranch37(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch49(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, Zero, bb, bc) → new_mkBalBranch6MkBalBranch45(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch44(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, wvw224200, bb, bc) → new_mkBalBranch6MkBalBranch410(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch015(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Neg(Succ(wvw229800)), Pos(wvw22990), bb, bc) → new_mkBalBranch6MkBalBranch019(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch1117(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Succ(wvw24530), bb, bc) → new_mkBalBranch6MkBalBranch1113(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw24530, Zero, bb, bc)
new_mkBalBranch6MkBalBranch1110(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Succ(wvw2390000), Zero, bb, bc) → new_mkBalBranch6MkBalBranch113(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, bb, bc)
new_mkBalBranch6MkBalBranch019(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, bb, bc) → new_mkBranch(Succ(Succ(Zero)), wvw21560, wvw21561, new_mkBranch(Succ(Succ(Succ(Zero))), wvw2152, wvw2153, wvw2224, wvw21563, bb, bc), wvw21564, bb, bc)
new_primMulNat0(wvw215900) → new_primPlusNat0(Zero, Succ(wvw215900))
new_mkBalBranch6MkBalBranch35(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, Zero, bb, bc) → new_mkBalBranch6MkBalBranch37(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch35(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw2294000), Zero, bb, bc) → new_mkBalBranch6MkBalBranch33(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_primMinusNat0(Zero, Succ(wvw128900)) → Neg(Succ(wvw128900))
new_mkBalBranch6MkBalBranch48(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, Zero, bb, bc) → new_mkBalBranch6MkBalBranch416(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch413(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw22850), bb, bc) → new_mkBalBranch6MkBalBranch416(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_ps(wvw1893, wvw1892) → new_primPlusInt(wvw1893, wvw1892)
new_mkBalBranch6MkBalBranch35(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, Succ(wvw236500), bb, bc) → new_mkBalBranch6MkBalBranch36(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch1110(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Zero, Zero, bb, bc) → new_mkBalBranch6MkBalBranch114(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, bb, bc)
new_mkBalBranch6MkBalBranch015(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Neg(Zero), Neg(wvw22990), bb, bc) → new_mkBalBranch6MkBalBranch0112(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, new_primMulNat(wvw22990), bb, bc)
new_mkBalBranch6MkBalBranch115(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, Branch(wvw222440, wvw222441, wvw222442, wvw222443, wvw222444), bb, bc) → new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero))))))))), wvw222440, wvw222441, new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero)))))))))), wvw22240, wvw22241, wvw22243, wvw222443, bb, bc), new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero))))))))))), wvw2152, wvw2153, wvw222444, wvw2156, bb, bc), bb, bc)
new_mkBalBranch6MkBalBranch0113(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Zero, Succ(wvw238400), bb, bc) → new_mkBalBranch6MkBalBranch019(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch0112(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Succ(wvw23820), bb, bc) → new_mkBalBranch6MkBalBranch016(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, wvw23820, Zero, bb, bc)
new_mkBalBranch6MkBalBranch418(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, Pos(wvw22770), bb, bc) → new_mkBalBranch6MkBalBranch420(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, new_primMulNat1(wvw22770), bb, bc)
new_mkBalBranch6MkBalBranch48(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, Succ(wvw22820), bb, bc) → new_mkBalBranch6MkBalBranch49(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, wvw22820, bb, bc)
new_mkBalBranch6MkBalBranch117(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw239000, wvw2451, bb, bc) → new_mkBalBranch6MkBalBranch118(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw2451, wvw239000, bb, bc)
new_mkBalBranch6MkBalBranch318(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc) → new_mkBranch(Succ(Zero), wvw2152, wvw2153, wvw2224, wvw2156, bb, bc)
new_mkBalBranch6MkBalBranch422(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, wvw2283, bb, bc) → new_mkBalBranch6MkBalBranch416(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch314(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw229400, wvw2366, bb, bc) → new_mkBalBranch6MkBalBranch33(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch0111(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Succ(wvw23800), bb, bc) → new_mkBalBranch6MkBalBranch019(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch47(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, bb, bc) → new_mkBalBranch6MkBalBranch45(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch411(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Pos(wvw22780), bb, bc) → new_mkBalBranch6MkBalBranch412(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, new_primMulNat1(wvw22780), bb, bc)
new_mkBalBranch6MkBalBranch414(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, Pos(wvw22790), bb, bc) → new_mkBalBranch6MkBalBranch415(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, new_primMulNat1(wvw22790), bb, bc)
new_mkBalBranch6MkBalBranch417(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Pos(Succ(wvw224200)), bb, bc) → new_mkBalBranch6MkBalBranch418(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, new_mkBalBranch6Size_l(wvw2225, wvw2152, wvw2153, wvw2156, bb, bc), bb, bc)
new_mkBalBranch6MkBalBranch1111(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Pos(Succ(wvw239000)), Pos(wvw23910), bb, bc) → new_mkBalBranch6MkBalBranch1112(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw239000, new_primMulNat(wvw23910), bb, bc)
new_mkBalBranch6MkBalBranch419(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Pos(wvw22800), bb, bc) → new_mkBalBranch6MkBalBranch421(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, new_primMulNat1(wvw22800), bb, bc)
new_mkBalBranch6MkBalBranch413(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, bb, bc) → new_mkBalBranch6MkBalBranch45(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch1114(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Succ(wvw24520), bb, bc) → new_mkBalBranch6MkBalBranch119(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, bb, bc)
new_mkBalBranch6MkBalBranch34(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw229400, Zero, bb, bc) → new_mkBalBranch6MkBalBranch33(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch53(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw22080000), bb, bc) → new_mkBalBranch6MkBalBranch54(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch016(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, wvw229800, Succ(wvw23840), bb, bc) → new_mkBalBranch6MkBalBranch0113(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, wvw229800, wvw23840, bb, bc)
new_mkBalBranch6Size_r(wvw2225, wvw2152, wvw2153, wvw2156, bb, bc) → new_sizeFM(wvw2156, bb, bc)
new_mkBalBranch6MkBalBranch0(wvw2225, wvw2152, wvw2153, EmptyFM, wvw2224, bb, bc) → error([])
new_mkBalBranch6MkBalBranch0113(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Zero, Zero, bb, bc) → new_mkBalBranch6MkBalBranch012(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch1111(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Neg(Succ(wvw239000)), Pos(wvw23910), bb, bc) → new_mkBalBranch6MkBalBranch1115(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw239000, new_primMulNat(wvw23910), bb, bc)
new_mkBalBranch6MkBalBranch012(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, bb, bc) → new_mkBalBranch6MkBalBranch013(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch312(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Neg(Succ(wvw229400)), Pos(wvw22950), bb, bc) → new_mkBalBranch6MkBalBranch310(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw229400, new_primMulNat1(wvw22950), bb, bc)
new_mkBalBranch6MkBalBranch018(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Zero, bb, bc) → new_mkBalBranch6MkBalBranch012(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch47(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw22890), bb, bc) → new_mkBalBranch6MkBalBranch48(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw22890, Zero, bb, bc)
new_mkBalBranch6MkBalBranch1111(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Neg(Succ(wvw239000)), Neg(wvw23910), bb, bc) → new_mkBalBranch6MkBalBranch117(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw239000, new_primMulNat(wvw23910), bb, bc)
new_mkBalBranch6MkBalBranch410(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc) → new_mkBalBranch6MkBalBranch46(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch1117(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Zero, bb, bc) → new_mkBalBranch6MkBalBranch114(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, bb, bc)
new_mkBalBranch6MkBalBranch1(wvw2225, wvw2152, wvw2153, wvw2156, Branch(wvw22240, wvw22241, wvw22242, wvw22243, wvw22244), bb, bc) → new_mkBalBranch6MkBalBranch1111(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, new_sizeFM(wvw22244, bb, bc), new_sizeFM(wvw22243, bb, bc), bb, bc)
new_primMulNat1(Zero) → Zero
new_mkBalBranch6MkBalBranch016(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, wvw229800, Zero, bb, bc) → new_mkBalBranch6MkBalBranch014(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, bb, bc)
new_primPlusNat0(Succ(wvw1252000), Succ(wvw1260000)) → Succ(Succ(new_primPlusNat0(wvw1252000, wvw1260000)))
new_mkBalBranch6MkBalBranch1111(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Pos(Zero), Neg(wvw23910), bb, bc) → new_mkBalBranch6MkBalBranch112(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, new_primMulNat(wvw23910), bb, bc)
new_mkBalBranch6MkBalBranch421(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, bb, bc) → new_mkBalBranch6MkBalBranch45(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch312(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Neg(Zero), Neg(wvw22950), bb, bc) → new_mkBalBranch6MkBalBranch317(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, new_primMulNat1(wvw22950), bb, bc)
new_primPlusNat0(Zero, Zero) → Zero
new_mkBalBranch6MkBalBranch015(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Pos(Zero), Pos(wvw22990), bb, bc) → new_mkBalBranch6MkBalBranch017(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, new_primMulNat(wvw22990), bb, bc)
new_mkBalBranch6MkBalBranch0110(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Succ(wvw23860), wvw229800, bb, bc) → new_mkBalBranch6MkBalBranch0113(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, wvw23860, wvw229800, bb, bc)
new_mkBalBranch6MkBalBranch49(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, Succ(wvw228200), bb, bc) → new_mkBalBranch6MkBalBranch410(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch317(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw23720), bb, bc) → new_mkBalBranch6MkBalBranch34(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw23720, Zero, bb, bc)
new_mkBalBranch6MkBalBranch412(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw22840), bb, bc) → new_mkBalBranch6MkBalBranch44(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, wvw22840, bb, bc)
new_primPlusInt(Neg(wvw18930), Neg(wvw18920)) → Neg(new_primPlusNat0(wvw18930, wvw18920))
new_mkBalBranch6MkBalBranch0112(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Zero, bb, bc) → new_mkBalBranch6MkBalBranch012(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, bb, bc)
new_primMinusNat0(Succ(wvw12860), Zero) → Pos(Succ(wvw12860))
new_sizeFM(EmptyFM, bf, bg) → Pos(Zero)
new_mkBalBranch6MkBalBranch0111(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Zero, bb, bc) → new_mkBalBranch6MkBalBranch012(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch015(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Pos(Succ(wvw229800)), Pos(wvw22990), bb, bc) → new_mkBalBranch6MkBalBranch016(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, wvw229800, new_primMulNat(wvw22990), bb, bc)
new_mkBalBranch6MkBalBranch417(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Neg(Succ(wvw224200)), bb, bc) → new_mkBalBranch6MkBalBranch414(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, new_mkBalBranch6Size_l(wvw2225, wvw2152, wvw2153, wvw2156, bb, bc), bb, bc)
new_mkBalBranch6MkBalBranch017(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Succ(wvw23760), bb, bc) → new_mkBalBranch6MkBalBranch0110(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Zero, wvw23760, bb, bc)
new_mkBalBranch6MkBalBranch1113(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw239000, Zero, bb, bc) → new_mkBalBranch6MkBalBranch113(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, bb, bc)
new_mkBalBranch6MkBalBranch35(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw2294000), Succ(wvw236500), bb, bc) → new_mkBalBranch6MkBalBranch35(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw2294000, wvw236500, bb, bc)
new_mkBalBranch6MkBalBranch315(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw23670), bb, bc) → new_mkBalBranch6MkBalBranch39(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, wvw23670, bb, bc)
new_sizeFM(Branch(wvw18440, wvw18441, wvw18442, wvw18443, wvw18444), bf, bg) → wvw18442
new_mkBalBranch6MkBalBranch417(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Neg(Zero), bb, bc) → new_mkBalBranch6MkBalBranch419(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, new_mkBalBranch6Size_l(wvw2225, wvw2152, wvw2153, wvw2156, bb, bc), bb, bc)
new_mkBalBranch6MkBalBranch312(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Pos(Succ(wvw229400)), Neg(wvw22950), bb, bc) → new_mkBalBranch6MkBalBranch314(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw229400, new_primMulNat1(wvw22950), bb, bc)
new_mkBalBranch6MkBalBranch1111(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Pos(Zero), Pos(wvw23910), bb, bc) → new_mkBalBranch6MkBalBranch1116(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, new_primMulNat(wvw23910), bb, bc)
new_mkBalBranch6MkBalBranch54(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc) → new_mkBalBranch6MkBalBranch417(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, new_mkBalBranch6Size_r(wvw2225, wvw2152, wvw2153, wvw2156, bb, bc), bb, bc)
new_mkBalBranch6MkBalBranch015(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Pos(Zero), Neg(wvw22990), bb, bc) → new_mkBalBranch6MkBalBranch018(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, new_primMulNat(wvw22990), bb, bc)
new_mkBalBranch6MkBalBranch36(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc) → new_mkBalBranch6MkBalBranch318(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch312(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Neg(Succ(wvw229400)), Neg(wvw22950), bb, bc) → new_mkBalBranch6MkBalBranch38(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw229400, new_primMulNat1(wvw22950), bb, bc)
new_mkBalBranch6MkBalBranch52(wvw2167, wvw2164, wvw2165, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, Neg(Zero), h, ba) → new_mkBalBranch6MkBalBranch51(wvw2167, wvw2164, wvw2165, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, h, ba)
new_mkBalBranch6MkBalBranch311(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, bb, bc) → new_mkBalBranch6MkBalBranch37(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch33(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc) → new_mkBalBranch6MkBalBranch1(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch1114(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Zero, bb, bc) → new_mkBalBranch6MkBalBranch114(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, bb, bc)
new_mkBalBranch6MkBalBranch0110(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Zero, wvw229800, bb, bc) → new_mkBalBranch6MkBalBranch019(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, bb, bc)
new_mkBalBranch0(wvw2164, wvw2165, wvw2167, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, h, ba) → new_mkBalBranch6MkBalBranch52(wvw2167, wvw2164, wvw2165, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, new_ps(new_sizeFM(wvw2167, h, ba), new_sizeFM(new_deleteMax0(wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, h, ba), h, ba)), h, ba)
new_primMulNat1(Succ(wvw215900)) → new_primPlusNat0(new_primPlusNat0(new_primPlusNat0(new_primPlusNat0(new_primMulNat0(wvw215900), Succ(wvw215900)), Succ(wvw215900)), Succ(wvw215900)), Succ(wvw215900))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_mkBalBranch6MkBalBranch112(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Zero, bb, bc) → new_mkBalBranch6MkBalBranch114(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, bb, bc)
new_mkBalBranch6MkBalBranch015(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Neg(Succ(wvw229800)), Neg(wvw22990), bb, bc) → new_mkBalBranch6MkBalBranch0110(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, new_primMulNat(wvw22990), wvw229800, bb, bc)
new_mkBalBranch6MkBalBranch312(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Pos(Succ(wvw229400)), Pos(wvw22950), bb, bc) → new_mkBalBranch6MkBalBranch313(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw229400, new_primMulNat1(wvw22950), bb, bc)
new_mkBalBranch6MkBalBranch419(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Neg(wvw22800), bb, bc) → new_mkBalBranch6MkBalBranch47(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, new_primMulNat1(wvw22800), bb, bc)
new_mkBalBranch6Size_l(wvw2225, wvw2152, wvw2153, wvw2156, bb, bc) → new_sizeFM(wvw2225, bb, bc)
new_mkBalBranch6MkBalBranch1111(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Pos(Succ(wvw239000)), Neg(wvw23910), bb, bc) → new_mkBalBranch6MkBalBranch116(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw239000, new_primMulNat(wvw23910), bb, bc)
new_mkBalBranch6MkBalBranch118(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Zero, wvw239000, bb, bc) → new_mkBalBranch6MkBalBranch119(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, bb, bc)
new_mkBalBranch6MkBalBranch1111(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Neg(Zero), Neg(wvw23910), bb, bc) → new_mkBalBranch6MkBalBranch1117(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, new_primMulNat(wvw23910), bb, bc)
new_mkBalBranch6MkBalBranch1110(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Succ(wvw2390000), Succ(wvw244600), bb, bc) → new_mkBalBranch6MkBalBranch1110(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw2390000, wvw244600, bb, bc)
new_mkBalBranch6MkBalBranch1110(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Zero, Succ(wvw244600), bb, bc) → new_mkBalBranch6MkBalBranch119(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, bb, bc)
new_mkBalBranch6MkBalBranch113(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, bb, bc) → new_mkBalBranch6MkBalBranch115(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, bb, bc)
new_mkBalBranch6MkBalBranch51(wvw2167, wvw2164, wvw2165, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, h, ba) → new_mkBranch(Zero, wvw2164, wvw2165, wvw2167, new_deleteMax0(wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, h, ba), h, ba)
new_mkBalBranch6MkBalBranch013(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, Branch(wvw215630, wvw215631, wvw215632, wvw215633, wvw215634), wvw21564, wvw2224, bb, bc) → new_mkBranch(Succ(Succ(Succ(Succ(Zero)))), wvw215630, wvw215631, new_mkBranch(Succ(Succ(Succ(Succ(Succ(Zero))))), wvw2152, wvw2153, wvw2224, wvw215633, bb, bc), new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Zero)))))), wvw21560, wvw21561, wvw215634, wvw21564, bb, bc), bb, bc)
new_mkBalBranch6MkBalBranch52(wvw2167, wvw2164, wvw2165, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, Pos(Succ(Succ(wvw2216000))), h, ba) → new_mkBalBranch6MkBalBranch53(wvw2167, wvw2164, wvw2165, new_deleteMax0(wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, h, ba), wvw2167, wvw2216000, h, ba)
new_primPlusInt(Pos(wvw18930), Pos(wvw18920)) → Pos(new_primPlusNat0(wvw18930, wvw18920))
new_mkBalBranch6MkBalBranch415(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, wvw2286, bb, bc) → new_mkBalBranch6MkBalBranch410(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch014(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, bb, bc) → new_mkBalBranch6MkBalBranch013(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch45(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc) → new_mkBalBranch6MkBalBranch46(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch34(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw229400, Succ(wvw23650), bb, bc) → new_mkBalBranch6MkBalBranch35(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw229400, wvw23650, bb, bc)
new_primMulNat(Succ(wvw229900)) → new_primPlusNat0(new_primMulNat0(wvw229900), Succ(wvw229900))
new_mkBalBranch6MkBalBranch421(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw22880), bb, bc) → new_mkBalBranch6MkBalBranch410(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch37(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc) → new_mkBalBranch6MkBalBranch318(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_primPlusNat0(Succ(wvw1252000), Zero) → Succ(wvw1252000)
new_primPlusNat0(Zero, Succ(wvw1260000)) → Succ(wvw1260000)
new_deleteMax0(wvw21680, wvw21681, wvw21682, wvw21683, EmptyFM, h, ba) → wvw21683
new_mkBalBranch6MkBalBranch311(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw23710), bb, bc) → new_mkBalBranch6MkBalBranch36(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc)
new_mkBalBranch6MkBalBranch118(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Succ(wvw24510), wvw239000, bb, bc) → new_mkBalBranch6MkBalBranch1110(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw24510, wvw239000, bb, bc)
new_mkBalBranch6MkBalBranch114(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, bb, bc) → new_mkBalBranch6MkBalBranch115(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, bb, bc)
new_mkBalBranch6MkBalBranch46(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, bb, bc) → new_mkBalBranch6MkBalBranch312(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, new_mkBalBranch6Size_l(wvw2225, wvw2152, wvw2153, wvw2156, bb, bc), new_mkBalBranch6Size_r(wvw2225, wvw2152, wvw2153, wvw2156, bb, bc), bb, bc)
new_mkBalBranch6MkBalBranch39(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw23700), wvw229400, bb, bc) → new_mkBalBranch6MkBalBranch35(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw23700, wvw229400, bb, bc)
new_primMinusNat0(Succ(wvw12860), Succ(wvw128900)) → new_primMinusNat0(wvw12860, wvw128900)
new_mkBalBranch6MkBalBranch44(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw22870), wvw224200, bb, bc) → new_mkBalBranch6MkBalBranch49(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw22870, wvw224200, bb, bc)
new_mkBalBranch6MkBalBranch013(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, EmptyFM, wvw21564, wvw2224, bb, bc) → error([])
The set Q consists of the following terms:
new_primPlusNat0(Succ(x0), Zero)
new_mkBalBranch6MkBalBranch118(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10, x11)
new_mkBalBranch6MkBalBranch411(x0, x1, x2, x3, x4, Neg(x5), x6, x7)
new_mkBalBranch6MkBalBranch013(x0, x1, x2, x3, x4, x5, EmptyFM, x6, x7, x8, x9)
new_primPlusNat0(Zero, Succ(x0))
new_mkBalBranch6MkBalBranch0(x0, x1, x2, EmptyFM, x3, x4, x5)
new_mkBalBranch6MkBalBranch116(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12)
new_mkBalBranch6MkBalBranch0111(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch412(x0, x1, x2, x3, x4, Succ(x5), x6, x7)
new_mkBalBranch6MkBalBranch312(x0, x1, x2, x3, x4, Pos(Zero), Pos(x5), x6, x7)
new_primMulNat(Zero)
new_mkBalBranch6MkBalBranch47(x0, x1, x2, x3, x4, Zero, x5, x6)
new_mkBalBranch6MkBalBranch015(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(Zero), Pos(x9), x10, x11)
new_mkBalBranch6MkBalBranch112(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch411(x0, x1, x2, x3, x4, Pos(x5), x6, x7)
new_ps(x0, x1)
new_mkBalBranch6MkBalBranch415(x0, x1, x2, x3, x4, x5, x6, x7, x8)
new_mkBalBranch6MkBalBranch113(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)
new_mkBalBranch6MkBalBranch412(x0, x1, x2, x3, x4, Zero, x5, x6)
new_mkBalBranch6MkBalBranch019(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)
new_mkBalBranch0(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9)
new_primMinusNat0(Zero, Zero)
new_mkBalBranch6MkBalBranch0113(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch51(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9)
new_mkBalBranch6MkBalBranch414(x0, x1, x2, x3, x4, x5, Pos(x6), x7, x8)
new_mkBalBranch6MkBalBranch414(x0, x1, x2, x3, x4, x5, Neg(x6), x7, x8)
new_mkBalBranch6MkBalBranch46(x0, x1, x2, x3, x4, x5, x6)
new_primPlusInt(Pos(x0), Pos(x1))
new_mkBalBranch6MkBalBranch115(x0, x1, x2, x3, x4, x5, x6, x7, EmptyFM, x8, x9)
new_mkBalBranch6MkBalBranch413(x0, x1, x2, x3, x4, Succ(x5), x6, x7)
new_mkBalBranch6MkBalBranch0110(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11, x12)
new_primPlusInt(Neg(x0), Neg(x1))
new_mkBalBranch6MkBalBranch017(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch014(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)
new_mkBalBranch6MkBalBranch318(x0, x1, x2, x3, x4, x5, x6)
new_mkBalBranch6MkBalBranch52(x0, x1, x2, x3, x4, x5, x6, x7, Pos(Succ(Succ(x8))), x9, x10)
new_mkBalBranch6MkBalBranch312(x0, x1, x2, x3, x4, Pos(Succ(x5)), Pos(x6), x7, x8)
new_deleteMax0(x0, x1, x2, x3, Branch(x4, x5, x6, x7, x8), x9, x10)
new_mkBalBranch6MkBalBranch1113(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, Succ(x10), x11, x12)
new_mkBranchUnbox(x0, x1, x2, x3, x4, x5)
new_mkBalBranch6MkBalBranch1112(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12)
new_mkBalBranch6MkBalBranch1110(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch38(x0, x1, x2, x3, x4, x5, x6, x7, x8)
new_mkBalBranch6MkBalBranch313(x0, x1, x2, x3, x4, x5, x6, x7, x8)
new_mkBalBranch6MkBalBranch49(x0, x1, x2, x3, x4, Zero, Zero, x5, x6)
new_primMinusNat0(Succ(x0), Succ(x1))
new_mkBalBranch6MkBalBranch1113(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, Zero, x10, x11)
new_mkBalBranch6MkBalBranch49(x0, x1, x2, x3, x4, Zero, Succ(x5), x6, x7)
new_primMinusNat0(Succ(x0), Zero)
new_mkBalBranch6MkBalBranch312(x0, x1, x2, x3, x4, Neg(Zero), Neg(x5), x6, x7)
new_mkBalBranch6MkBalBranch315(x0, x1, x2, x3, x4, Succ(x5), x6, x7)
new_mkBalBranch6MkBalBranch1110(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), Succ(x10), x11, x12)
new_mkBalBranch6MkBalBranch311(x0, x1, x2, x3, x4, Succ(x5), x6, x7)
new_mkBalBranch6MkBalBranch017(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6MkBalBranch1117(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_deleteMax0(x0, x1, x2, x3, EmptyFM, x4, x5)
new_mkBalBranch6Size_r(x0, x1, x2, x3, x4, x5)
new_mkBalBranch6MkBalBranch0112(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6MkBalBranch47(x0, x1, x2, x3, x4, Succ(x5), x6, x7)
new_mkBalBranch6MkBalBranch311(x0, x1, x2, x3, x4, Zero, x5, x6)
new_mkBalBranch6MkBalBranch33(x0, x1, x2, x3, x4, x5, x6)
new_mkBalBranch6MkBalBranch1111(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(Succ(x9)), Neg(x10), x11, x12)
new_mkBalBranch6MkBalBranch419(x0, x1, x2, x3, x4, Neg(x5), x6, x7)
new_mkBalBranch6MkBalBranch35(x0, x1, x2, x3, x4, Zero, Zero, x5, x6)
new_mkBalBranch6MkBalBranch310(x0, x1, x2, x3, x4, x5, x6, x7, x8)
new_mkBalBranch6MkBalBranch016(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, Succ(x10), x11, x12)
new_mkBalBranch6MkBalBranch421(x0, x1, x2, x3, x4, Succ(x5), x6, x7)
new_mkBalBranch6MkBalBranch37(x0, x1, x2, x3, x4, x5, x6)
new_mkBalBranch6MkBalBranch315(x0, x1, x2, x3, x4, Zero, x5, x6)
new_mkBalBranch6MkBalBranch013(x0, x1, x2, x3, x4, x5, Branch(x6, x7, x8, x9, x10), x11, x12, x13, x14)
new_mkBalBranch6MkBalBranch0113(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), Zero, x10, x11)
new_mkBalBranch6MkBalBranch0113(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, Zero, x9, x10)
new_mkBalBranch6MkBalBranch312(x0, x1, x2, x3, x4, Pos(Zero), Neg(x5), x6, x7)
new_mkBalBranch6MkBalBranch312(x0, x1, x2, x3, x4, Neg(Zero), Pos(x5), x6, x7)
new_mkBalBranch6MkBalBranch52(x0, x1, x2, x3, x4, x5, x6, x7, Pos(Zero), x8, x9)
new_mkBalBranch6MkBalBranch0113(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), Succ(x10), x11, x12)
new_mkBalBranch6MkBalBranch48(x0, x1, x2, x3, x4, x5, Zero, x6, x7)
new_mkBalBranch6MkBalBranch317(x0, x1, x2, x3, x4, Succ(x5), x6, x7)
new_mkBalBranch6MkBalBranch35(x0, x1, x2, x3, x4, Zero, Succ(x5), x6, x7)
new_primPlusNat0(Succ(x0), Succ(x1))
new_mkBalBranch6MkBalBranch1115(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12)
new_mkBalBranch6MkBalBranch52(x0, x1, x2, x3, x4, x5, x6, x7, Neg(Succ(x8)), x9, x10)
new_mkBalBranch6MkBalBranch314(x0, x1, x2, x3, x4, x5, x6, x7, x8)
new_mkBalBranch6MkBalBranch39(x0, x1, x2, x3, x4, Succ(x5), x6, x7, x8)
new_mkBalBranch6MkBalBranch114(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)
new_mkBalBranch6MkBalBranch48(x0, x1, x2, x3, x4, x5, Succ(x6), x7, x8)
new_mkBalBranch6MkBalBranch015(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(Succ(x9)), Pos(x10), x11, x12)
new_mkBalBranch6MkBalBranch419(x0, x1, x2, x3, x4, Pos(x5), x6, x7)
new_mkBalBranch6MkBalBranch34(x0, x1, x2, x3, x4, x5, Zero, x6, x7)
new_mkBalBranch6MkBalBranch44(x0, x1, x2, x3, x4, Succ(x5), x6, x7, x8)
new_mkBalBranch6MkBalBranch1111(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(Zero), Pos(x9), x10, x11)
new_mkBalBranch6MkBalBranch49(x0, x1, x2, x3, x4, Succ(x5), Succ(x6), x7, x8)
new_mkBalBranch6MkBalBranch417(x0, x1, x2, x3, x4, Pos(Zero), x5, x6)
new_mkBalBranch6MkBalBranch317(x0, x1, x2, x3, x4, Zero, x5, x6)
new_mkBalBranch6MkBalBranch416(x0, x1, x2, x3, x4, x5, x6)
new_mkBalBranch6MkBalBranch0111(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6MkBalBranch422(x0, x1, x2, x3, x4, x5, x6, x7, x8)
new_mkBalBranch6MkBalBranch45(x0, x1, x2, x3, x4, x5, x6)
new_mkBalBranch6MkBalBranch1111(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(Succ(x9)), Pos(x10), x11, x12)
new_primMulNat(Succ(x0))
new_mkBalBranch6MkBalBranch1110(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, Zero, x9, x10)
new_primMulNat1(Succ(x0))
new_primMulNat1(Zero)
new_mkBalBranch6MkBalBranch52(x0, x1, x2, x3, x4, x5, x6, x7, Pos(Succ(Zero)), x8, x9)
new_mkBalBranch6MkBalBranch1110(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), Zero, x10, x11)
new_mkBalBranch6MkBalBranch1111(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(Succ(x9)), Neg(x10), x11, x12)
new_mkBalBranch6MkBalBranch0(x0, x1, x2, Branch(x3, x4, x5, x6, x7), x8, x9, x10)
new_mkBalBranch6MkBalBranch1111(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(Succ(x9)), Pos(x10), x11, x12)
new_mkBalBranch6MkBalBranch417(x0, x1, x2, x3, x4, Neg(Zero), x5, x6)
new_mkBalBranch6MkBalBranch015(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(Succ(x9)), Neg(x10), x11, x12)
new_mkBalBranch6MkBalBranch316(x0, x1, x2, x3, x4, Succ(x5), x6, x7)
new_mkBalBranch6MkBalBranch1114(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6MkBalBranch43(x0, x1, x2, x3, x4, x5, x6, x7, x8)
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Succ(x0))
new_mkBalBranch6MkBalBranch1117(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_primPlusNat0(Zero, Zero)
new_mkBalBranch6MkBalBranch115(x0, x1, x2, x3, x4, x5, x6, x7, Branch(x8, x9, x10, x11, x12), x13, x14)
new_sizeFM(EmptyFM, x0, x1)
new_mkBalBranch6MkBalBranch49(x0, x1, x2, x3, x4, Succ(x5), Zero, x6, x7)
new_mkBalBranch6MkBalBranch53(x0, x1, x2, x3, x4, Zero, x5, x6)
new_primMulNat0(x0)
new_mkBalBranch6MkBalBranch1111(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(Zero), Neg(x9), x10, x11)
new_mkBalBranch6MkBalBranch417(x0, x1, x2, x3, x4, Neg(Succ(x5)), x6, x7)
new_mkBalBranch6MkBalBranch418(x0, x1, x2, x3, x4, x5, Neg(x6), x7, x8)
new_mkBalBranch6MkBalBranch35(x0, x1, x2, x3, x4, Succ(x5), Zero, x6, x7)
new_mkBalBranch6MkBalBranch016(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, Zero, x10, x11)
new_mkBalBranch6MkBalBranch1(x0, x1, x2, x3, EmptyFM, x4, x5)
new_mkBalBranch6MkBalBranch118(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11, x12)
new_mkBalBranch6MkBalBranch417(x0, x1, x2, x3, x4, Pos(Succ(x5)), x6, x7)
new_mkBalBranch6MkBalBranch0112(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch421(x0, x1, x2, x3, x4, Zero, x5, x6)
new_mkBalBranch6MkBalBranch012(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)
new_mkBalBranch6MkBalBranch1(x0, x1, x2, x3, Branch(x4, x5, x6, x7, x8), x9, x10)
new_mkBalBranch6MkBalBranch312(x0, x1, x2, x3, x4, Neg(Succ(x5)), Neg(x6), x7, x8)
new_mkBalBranch6MkBalBranch54(x0, x1, x2, x3, x4, x5, x6)
new_mkBalBranch6MkBalBranch1111(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(Zero), Neg(x9), x10, x11)
new_mkBalBranch6MkBalBranch1111(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(Zero), Pos(x9), x10, x11)
new_mkBranch(x0, x1, x2, x3, x4, x5, x6)
new_mkBalBranch6MkBalBranch34(x0, x1, x2, x3, x4, x5, Succ(x6), x7, x8)
new_mkBalBranch6MkBalBranch119(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)
new_mkBalBranch6MkBalBranch0110(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10, x11)
new_mkBalBranch6MkBalBranch35(x0, x1, x2, x3, x4, Succ(x5), Succ(x6), x7, x8)
new_mkBalBranch6MkBalBranch53(x0, x1, x2, x3, x4, Succ(x5), x6, x7)
new_mkBalBranch6MkBalBranch420(x0, x1, x2, x3, x4, x5, x6, x7, x8)
new_mkBalBranch6MkBalBranch018(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch410(x0, x1, x2, x3, x4, x5, x6)
new_mkBalBranch6MkBalBranch015(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(Succ(x9)), Neg(x10), x11, x12)
new_mkBalBranch6MkBalBranch015(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(Succ(x9)), Pos(x10), x11, x12)
new_mkBalBranch6Size_l(x0, x1, x2, x3, x4, x5)
new_mkBalBranch6MkBalBranch117(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12)
new_mkBalBranch6MkBalBranch112(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6MkBalBranch1116(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch015(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(Zero), Neg(x9), x10, x11)
new_mkBalBranch6MkBalBranch015(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(Zero), Pos(x9), x10, x11)
new_mkBalBranch6MkBalBranch36(x0, x1, x2, x3, x4, x5, x6)
new_mkBalBranch6MkBalBranch44(x0, x1, x2, x3, x4, Zero, x5, x6, x7)
new_mkBalBranch6MkBalBranch39(x0, x1, x2, x3, x4, Zero, x5, x6, x7)
new_mkBalBranch6MkBalBranch316(x0, x1, x2, x3, x4, Zero, x5, x6)
new_mkBalBranch6MkBalBranch1114(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch018(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6MkBalBranch52(x0, x1, x2, x3, x4, x5, x6, x7, Neg(Zero), x8, x9)
new_mkBalBranch6MkBalBranch413(x0, x1, x2, x3, x4, Zero, x5, x6)
new_mkBalBranch6MkBalBranch418(x0, x1, x2, x3, x4, x5, Pos(x6), x7, x8)
new_mkBalBranch6MkBalBranch312(x0, x1, x2, x3, x4, Pos(Succ(x5)), Neg(x6), x7, x8)
new_mkBalBranch6MkBalBranch312(x0, x1, x2, x3, x4, Neg(Succ(x5)), Pos(x6), x7, x8)
new_sizeFM(Branch(x0, x1, x2, x3, x4), x5, x6)
new_mkBalBranch6MkBalBranch1116(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6MkBalBranch015(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(Zero), Neg(x9), x10, x11)
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch(wvw2164, wvw2165, wvw2167, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, h, ba) → new_mkBalBranch6MkBalBranch5(wvw2167, wvw2164, wvw2165, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, new_ps(new_sizeFM(wvw2167, h, ba), new_sizeFM(new_deleteMax0(wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, h, ba), h, ba)), h, ba)
The graph contains the following edges 3 >= 1, 1 >= 2, 2 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 10, 10 >= 11
- new_mkBalBranch(wvw2164, wvw2165, wvw2167, wvw21680, wvw21681, wvw21682, wvw21683, Branch(wvw216840, wvw216841, wvw216842, wvw216843, wvw216844), h, ba) → new_mkBalBranch(wvw21680, wvw21681, wvw21683, wvw216840, wvw216841, wvw216842, wvw216843, wvw216844, h, ba)
The graph contains the following edges 4 >= 1, 5 >= 2, 7 >= 3, 8 > 4, 8 > 5, 8 > 6, 8 > 7, 8 > 8, 9 >= 9, 10 >= 10
- new_deleteMax(wvw21680, wvw21681, wvw21682, wvw21683, Branch(wvw216840, wvw216841, wvw216842, wvw216843, wvw216844), h, ba) → new_mkBalBranch(wvw21680, wvw21681, wvw21683, wvw216840, wvw216841, wvw216842, wvw216843, wvw216844, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 4 >= 3, 5 > 4, 5 > 5, 5 > 6, 5 > 7, 5 > 8, 6 >= 9, 7 >= 10
- new_mkBalBranch6MkBalBranch50(wvw2167, wvw2164, wvw2165, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, h, ba) → new_deleteMax(wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, h, ba)
The graph contains the following edges 4 >= 1, 5 >= 2, 6 >= 3, 7 >= 4, 8 >= 5, 9 >= 6, 10 >= 7
- new_mkBalBranch6MkBalBranch5(wvw2167, wvw2164, wvw2165, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, Neg(Succ(wvw221600)), h, ba) → new_deleteMax(wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, h, ba)
The graph contains the following edges 4 >= 1, 5 >= 2, 6 >= 3, 7 >= 4, 8 >= 5, 10 >= 6, 11 >= 7
- new_mkBalBranch6MkBalBranch5(wvw2167, wvw2164, wvw2165, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, Pos(Succ(Succ(wvw2216000))), h, ba) → new_deleteMax(wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, h, ba)
The graph contains the following edges 4 >= 1, 5 >= 2, 6 >= 3, 7 >= 4, 8 >= 5, 10 >= 6, 11 >= 7
- new_mkBalBranch6MkBalBranch5(wvw2167, wvw2164, wvw2165, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, Neg(Zero), h, ba) → new_mkBalBranch6MkBalBranch50(wvw2167, wvw2164, wvw2165, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 10 >= 9, 11 >= 10
- new_mkBalBranch6MkBalBranch5(wvw2167, wvw2164, wvw2165, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, Pos(Zero), h, ba) → new_mkBalBranch6MkBalBranch50(wvw2167, wvw2164, wvw2165, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 10 >= 9, 11 >= 10
- new_mkBalBranch6MkBalBranch5(wvw2167, wvw2164, wvw2165, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, Pos(Succ(Zero)), h, ba) → new_mkBalBranch6MkBalBranch50(wvw2167, wvw2164, wvw2165, wvw21680, wvw21681, wvw21682, wvw21683, wvw21684, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 10 >= 9, 11 >= 10
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_deleteMax1(wvw3340, wvw3341, wvw3342, wvw3343, Branch(wvw33440, wvw33441, wvw33442, wvw33443, wvw33444), h) → new_mkBalBranch1(wvw3340, wvw3341, wvw3343, wvw33440, wvw33441, wvw33442, wvw33443, wvw33444, h)
new_mkBalBranch1(wvw330, wvw331, wvw333, wvw3340, wvw3341, wvw3342, wvw3343, wvw3344, h) → new_deleteMax1(wvw3340, wvw3341, wvw3342, wvw3343, wvw3344, h)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch1(wvw330, wvw331, wvw333, wvw3340, wvw3341, wvw3342, wvw3343, wvw3344, h) → new_deleteMax1(wvw3340, wvw3341, wvw3342, wvw3343, wvw3344, h)
The graph contains the following edges 4 >= 1, 5 >= 2, 6 >= 3, 7 >= 4, 8 >= 5, 9 >= 6
- new_deleteMax1(wvw3340, wvw3341, wvw3342, wvw3343, Branch(wvw33440, wvw33441, wvw33442, wvw33443, wvw33444), h) → new_mkBalBranch1(wvw3340, wvw3341, wvw3343, wvw33440, wvw33441, wvw33442, wvw33443, wvw33444, h)
The graph contains the following edges 1 >= 1, 2 >= 2, 4 >= 3, 5 > 4, 5 > 5, 5 > 6, 5 > 7, 5 > 8, 6 >= 9
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch55(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2152, wvw2153, wvw2156, Pos(Succ(Succ(wvw2208000))), h, ba) → new_deleteMin(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, h, ba)
new_mkBalBranch2(wvw2152, wvw2153, wvw21550, wvw21551, wvw21552, Branch(wvw215530, wvw215531, wvw215532, wvw215533, wvw215534), wvw21554, wvw2156, h, ba) → new_mkBalBranch2(wvw21550, wvw21551, wvw215530, wvw215531, wvw215532, wvw215533, wvw215534, wvw21554, h, ba)
new_mkBalBranch6MkBalBranch55(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2152, wvw2153, wvw2156, Pos(Zero), h, ba) → new_mkBalBranch6MkBalBranch56(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2152, wvw2153, wvw2156, h, ba)
new_mkBalBranch6MkBalBranch56(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2152, wvw2153, wvw2156, h, ba) → new_deleteMin(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, h, ba)
new_mkBalBranch2(wvw2152, wvw2153, wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2156, h, ba) → new_mkBalBranch6MkBalBranch55(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2152, wvw2153, wvw2156, new_ps(new_sizeFM(new_deleteMin0(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, h, ba), h, ba), new_sizeFM(wvw2156, h, ba)), h, ba)
new_mkBalBranch6MkBalBranch55(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2152, wvw2153, wvw2156, Neg(Zero), h, ba) → new_mkBalBranch6MkBalBranch56(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2152, wvw2153, wvw2156, h, ba)
new_deleteMin(wvw21550, wvw21551, wvw21552, Branch(wvw215530, wvw215531, wvw215532, wvw215533, wvw215534), wvw21554, h, ba) → new_mkBalBranch2(wvw21550, wvw21551, wvw215530, wvw215531, wvw215532, wvw215533, wvw215534, wvw21554, h, ba)
new_mkBalBranch6MkBalBranch55(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2152, wvw2153, wvw2156, Pos(Succ(Zero)), h, ba) → new_mkBalBranch6MkBalBranch56(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2152, wvw2153, wvw2156, h, ba)
new_mkBalBranch6MkBalBranch55(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2152, wvw2153, wvw2156, Neg(Succ(wvw220800)), h, ba) → new_deleteMin(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, h, ba)
The TRS R consists of the following rules:
new_mkBalBranch6MkBalBranch1113(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw239000, Succ(wvw24460), h, ba) → new_mkBalBranch6MkBalBranch1110(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw239000, wvw24460, h, ba)
new_mkBalBranch6MkBalBranch43(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, wvw2287, h, ba) → new_mkBalBranch6MkBalBranch44(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw2287, wvw224200, h, ba)
new_mkBalBranch6MkBalBranch412(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, h, ba) → new_mkBalBranch6MkBalBranch45(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_mkBranch(wvw2435, wvw2436, wvw2437, wvw2438, wvw2439, bb, bc) → Branch(wvw2436, wvw2437, new_mkBranchUnbox(wvw2438, wvw2436, wvw2439, new_ps(new_ps(Pos(Succ(Zero)), new_sizeFM(wvw2438, bb, bc)), new_sizeFM(wvw2439, bb, bc)), bb, bc), wvw2438, wvw2439)
new_mkBalBranch6MkBalBranch015(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Neg(Zero), Pos(wvw22990), h, ba) → new_mkBalBranch6MkBalBranch0111(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, new_primMulNat(wvw22990), h, ba)
new_mkBalBranch3(wvw2152, wvw2153, wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2156, h, ba) → new_mkBalBranch6MkBalBranch57(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2152, wvw2153, wvw2156, new_ps(new_sizeFM(new_deleteMin0(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, h, ba), h, ba), new_sizeFM(wvw2156, h, ba)), h, ba)
new_primMulNat(Zero) → Zero
new_mkBalBranch6MkBalBranch49(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw2242000), Succ(wvw228200), h, ba) → new_mkBalBranch6MkBalBranch49(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw2242000, wvw228200, h, ba)
new_mkBalBranch6MkBalBranch0(wvw2225, wvw2152, wvw2153, Branch(wvw21560, wvw21561, wvw21562, wvw21563, wvw21564), wvw2224, h, ba) → new_mkBalBranch6MkBalBranch015(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, new_sizeFM(wvw21563, h, ba), new_sizeFM(wvw21564, h, ba), h, ba)
new_mkBalBranch6MkBalBranch015(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Pos(Succ(wvw229800)), Neg(wvw22990), h, ba) → new_mkBalBranch6MkBalBranch014(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch1116(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Zero, h, ba) → new_mkBalBranch6MkBalBranch114(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, h, ba)
new_mkBalBranch6MkBalBranch1111(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Neg(Zero), Pos(wvw23910), h, ba) → new_mkBalBranch6MkBalBranch1114(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, new_primMulNat(wvw23910), h, ba)
new_mkBalBranch6MkBalBranch312(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Pos(Zero), Pos(wvw22950), h, ba) → new_mkBalBranch6MkBalBranch315(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, new_primMulNat1(wvw22950), h, ba)
new_mkBalBranch6MkBalBranch313(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw229400, wvw2365, h, ba) → new_mkBalBranch6MkBalBranch34(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw229400, wvw2365, h, ba)
new_mkBalBranch6MkBalBranch312(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Neg(Zero), Pos(wvw22950), h, ba) → new_mkBalBranch6MkBalBranch311(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, new_primMulNat1(wvw22950), h, ba)
new_mkBalBranch6MkBalBranch115(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, EmptyFM, h, ba) → error([])
new_primPlusInt(Neg(wvw18930), Pos(wvw18920)) → new_primMinusNat0(wvw18920, wvw18930)
new_primPlusInt(Pos(wvw18930), Neg(wvw18920)) → new_primMinusNat0(wvw18930, wvw18920)
new_mkBalBranch6MkBalBranch310(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw229400, wvw2369, h, ba) → new_mkBalBranch6MkBalBranch36(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch017(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Zero, h, ba) → new_mkBalBranch6MkBalBranch012(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch417(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Pos(Zero), h, ba) → new_mkBalBranch6MkBalBranch411(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, new_mkBalBranch6Size_l(wvw2225, wvw2152, wvw2153, wvw2156, h, ba), h, ba)
new_mkBalBranch6MkBalBranch53(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, h, ba) → new_mkBalBranch6MkBalBranch54(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch39(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, wvw229400, h, ba) → new_mkBalBranch6MkBalBranch36(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch49(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw2242000), Zero, h, ba) → new_mkBalBranch6MkBalBranch416(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch312(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Pos(Zero), Neg(wvw22950), h, ba) → new_mkBalBranch6MkBalBranch316(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, new_primMulNat1(wvw22950), h, ba)
new_mkBalBranch6MkBalBranch411(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Neg(wvw22780), h, ba) → new_mkBalBranch6MkBalBranch413(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, new_primMulNat1(wvw22780), h, ba)
new_mkBalBranch6MkBalBranch315(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, h, ba) → new_mkBalBranch6MkBalBranch37(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch119(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, h, ba) → new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero))))))), wvw22240, wvw22241, wvw22243, new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero)))))))), wvw2152, wvw2153, wvw22244, wvw2156, h, ba), h, ba)
new_mkBalBranch6MkBalBranch420(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, wvw2282, h, ba) → new_mkBalBranch6MkBalBranch48(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, wvw2282, h, ba)
new_mkBalBranch6MkBalBranch0113(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Succ(wvw2298000), Zero, h, ba) → new_mkBalBranch6MkBalBranch014(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch018(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Succ(wvw23780), h, ba) → new_mkBalBranch6MkBalBranch014(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch414(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, Neg(wvw22790), h, ba) → new_mkBalBranch6MkBalBranch43(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, new_primMulNat1(wvw22790), h, ba)
new_mkBalBranch6MkBalBranch0113(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Succ(wvw2298000), Succ(wvw238400), h, ba) → new_mkBalBranch6MkBalBranch0113(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, wvw2298000, wvw238400, h, ba)
new_mkBranchUnbox(wvw2438, wvw2436, wvw2439, wvw2440, bb, bc) → wvw2440
new_mkBalBranch6MkBalBranch38(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw229400, wvw2370, h, ba) → new_mkBalBranch6MkBalBranch39(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw2370, wvw229400, h, ba)
new_mkBalBranch6MkBalBranch57(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2152, wvw2153, wvw2156, Pos(Zero), h, ba) → new_mkBalBranch6MkBalBranch58(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2152, wvw2153, wvw2156, h, ba)
new_mkBalBranch6MkBalBranch1116(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Succ(wvw24480), h, ba) → new_mkBalBranch6MkBalBranch118(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Zero, wvw24480, h, ba)
new_mkBalBranch6MkBalBranch418(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, Neg(wvw22770), h, ba) → new_mkBalBranch6MkBalBranch422(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, new_primMulNat1(wvw22770), h, ba)
new_mkBalBranch6MkBalBranch1(wvw2225, wvw2152, wvw2153, wvw2156, EmptyFM, h, ba) → error([])
new_mkBalBranch6MkBalBranch316(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw23680), h, ba) → new_mkBalBranch6MkBalBranch33(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch1112(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw239000, wvw2446, h, ba) → new_mkBalBranch6MkBalBranch1113(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw239000, wvw2446, h, ba)
new_mkBalBranch6MkBalBranch316(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, h, ba) → new_mkBalBranch6MkBalBranch37(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch1115(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw239000, wvw2450, h, ba) → new_mkBalBranch6MkBalBranch119(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, h, ba)
new_mkBalBranch6MkBalBranch112(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Succ(wvw24490), h, ba) → new_mkBalBranch6MkBalBranch113(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, h, ba)
new_mkBalBranch6MkBalBranch116(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw239000, wvw2447, h, ba) → new_mkBalBranch6MkBalBranch113(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, h, ba)
new_mkBalBranch6MkBalBranch416(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba) → new_mkBalBranch6MkBalBranch0(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch317(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, h, ba) → new_mkBalBranch6MkBalBranch37(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch49(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, Zero, h, ba) → new_mkBalBranch6MkBalBranch45(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch44(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, wvw224200, h, ba) → new_mkBalBranch6MkBalBranch410(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch015(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Neg(Succ(wvw229800)), Pos(wvw22990), h, ba) → new_mkBalBranch6MkBalBranch019(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch57(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2152, wvw2153, wvw2156, Pos(Succ(Succ(wvw2208000))), h, ba) → new_mkBalBranch6MkBalBranch53(new_deleteMin0(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, h, ba), wvw2152, wvw2153, wvw2156, new_deleteMin0(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, h, ba), wvw2208000, h, ba)
new_mkBalBranch6MkBalBranch1117(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Succ(wvw24530), h, ba) → new_mkBalBranch6MkBalBranch1113(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw24530, Zero, h, ba)
new_mkBalBranch6MkBalBranch1110(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Succ(wvw2390000), Zero, h, ba) → new_mkBalBranch6MkBalBranch113(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, h, ba)
new_mkBalBranch6MkBalBranch019(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, h, ba) → new_mkBranch(Succ(Succ(Zero)), wvw21560, wvw21561, new_mkBranch(Succ(Succ(Succ(Zero))), wvw2152, wvw2153, wvw2224, wvw21563, h, ba), wvw21564, h, ba)
new_primMulNat0(wvw215900) → new_primPlusNat0(Zero, Succ(wvw215900))
new_mkBalBranch6MkBalBranch35(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, Zero, h, ba) → new_mkBalBranch6MkBalBranch37(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch35(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw2294000), Zero, h, ba) → new_mkBalBranch6MkBalBranch33(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_primMinusNat0(Zero, Succ(wvw128900)) → Neg(Succ(wvw128900))
new_mkBalBranch6MkBalBranch48(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, Zero, h, ba) → new_mkBalBranch6MkBalBranch416(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch413(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw22850), h, ba) → new_mkBalBranch6MkBalBranch416(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_ps(wvw1893, wvw1892) → new_primPlusInt(wvw1893, wvw1892)
new_mkBalBranch6MkBalBranch35(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, Succ(wvw236500), h, ba) → new_mkBalBranch6MkBalBranch36(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch015(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Neg(Zero), Neg(wvw22990), h, ba) → new_mkBalBranch6MkBalBranch0112(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, new_primMulNat(wvw22990), h, ba)
new_mkBalBranch6MkBalBranch115(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, Branch(wvw222440, wvw222441, wvw222442, wvw222443, wvw222444), h, ba) → new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero))))))))), wvw222440, wvw222441, new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero)))))))))), wvw22240, wvw22241, wvw22243, wvw222443, h, ba), new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero))))))))))), wvw2152, wvw2153, wvw222444, wvw2156, h, ba), h, ba)
new_mkBalBranch6MkBalBranch1110(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Zero, Zero, h, ba) → new_mkBalBranch6MkBalBranch114(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, h, ba)
new_mkBalBranch6MkBalBranch0113(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Zero, Succ(wvw238400), h, ba) → new_mkBalBranch6MkBalBranch019(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch0112(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Succ(wvw23820), h, ba) → new_mkBalBranch6MkBalBranch016(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, wvw23820, Zero, h, ba)
new_mkBalBranch6MkBalBranch418(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, Pos(wvw22770), h, ba) → new_mkBalBranch6MkBalBranch420(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, new_primMulNat1(wvw22770), h, ba)
new_mkBalBranch6MkBalBranch48(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, Succ(wvw22820), h, ba) → new_mkBalBranch6MkBalBranch49(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, wvw22820, h, ba)
new_mkBalBranch6MkBalBranch117(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw239000, wvw2451, h, ba) → new_mkBalBranch6MkBalBranch118(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw2451, wvw239000, h, ba)
new_mkBalBranch6MkBalBranch318(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba) → new_mkBranch(Succ(Zero), wvw2152, wvw2153, wvw2224, wvw2156, h, ba)
new_mkBalBranch6MkBalBranch422(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, wvw2283, h, ba) → new_mkBalBranch6MkBalBranch416(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch314(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw229400, wvw2366, h, ba) → new_mkBalBranch6MkBalBranch33(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch0111(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Succ(wvw23800), h, ba) → new_mkBalBranch6MkBalBranch019(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch47(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, h, ba) → new_mkBalBranch6MkBalBranch45(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch411(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Pos(wvw22780), h, ba) → new_mkBalBranch6MkBalBranch412(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, new_primMulNat1(wvw22780), h, ba)
new_mkBalBranch6MkBalBranch414(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, Pos(wvw22790), h, ba) → new_mkBalBranch6MkBalBranch415(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, new_primMulNat1(wvw22790), h, ba)
new_mkBalBranch6MkBalBranch417(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Pos(Succ(wvw224200)), h, ba) → new_mkBalBranch6MkBalBranch418(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, new_mkBalBranch6Size_l(wvw2225, wvw2152, wvw2153, wvw2156, h, ba), h, ba)
new_mkBalBranch6MkBalBranch1111(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Pos(Succ(wvw239000)), Pos(wvw23910), h, ba) → new_mkBalBranch6MkBalBranch1112(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw239000, new_primMulNat(wvw23910), h, ba)
new_mkBalBranch6MkBalBranch419(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Pos(wvw22800), h, ba) → new_mkBalBranch6MkBalBranch421(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, new_primMulNat1(wvw22800), h, ba)
new_mkBalBranch6MkBalBranch413(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, h, ba) → new_mkBalBranch6MkBalBranch45(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch1114(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Succ(wvw24520), h, ba) → new_mkBalBranch6MkBalBranch119(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, h, ba)
new_mkBalBranch6MkBalBranch34(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw229400, Zero, h, ba) → new_mkBalBranch6MkBalBranch33(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch53(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw22080000), h, ba) → new_mkBalBranch6MkBalBranch54(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch016(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, wvw229800, Succ(wvw23840), h, ba) → new_mkBalBranch6MkBalBranch0113(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, wvw229800, wvw23840, h, ba)
new_mkBalBranch6MkBalBranch57(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2152, wvw2153, wvw2156, Neg(Succ(wvw220800)), h, ba) → new_mkBalBranch6MkBalBranch58(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2152, wvw2153, wvw2156, h, ba)
new_mkBalBranch6Size_r(wvw2225, wvw2152, wvw2153, wvw2156, h, ba) → new_sizeFM(wvw2156, h, ba)
new_mkBalBranch6MkBalBranch0(wvw2225, wvw2152, wvw2153, EmptyFM, wvw2224, h, ba) → error([])
new_mkBalBranch6MkBalBranch0113(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Zero, Zero, h, ba) → new_mkBalBranch6MkBalBranch012(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch1111(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Neg(Succ(wvw239000)), Pos(wvw23910), h, ba) → new_mkBalBranch6MkBalBranch1115(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw239000, new_primMulNat(wvw23910), h, ba)
new_mkBalBranch6MkBalBranch012(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, h, ba) → new_mkBalBranch6MkBalBranch013(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, h, ba)
new_deleteMin0(wvw21550, wvw21551, wvw21552, EmptyFM, wvw21554, h, ba) → wvw21554
new_mkBalBranch6MkBalBranch312(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Neg(Succ(wvw229400)), Pos(wvw22950), h, ba) → new_mkBalBranch6MkBalBranch310(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw229400, new_primMulNat1(wvw22950), h, ba)
new_mkBalBranch6MkBalBranch018(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Zero, h, ba) → new_mkBalBranch6MkBalBranch012(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch47(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw22890), h, ba) → new_mkBalBranch6MkBalBranch48(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw22890, Zero, h, ba)
new_mkBalBranch6MkBalBranch1111(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Neg(Succ(wvw239000)), Neg(wvw23910), h, ba) → new_mkBalBranch6MkBalBranch117(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw239000, new_primMulNat(wvw23910), h, ba)
new_mkBalBranch6MkBalBranch410(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba) → new_mkBalBranch6MkBalBranch46(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch1117(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Zero, h, ba) → new_mkBalBranch6MkBalBranch114(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, h, ba)
new_mkBalBranch6MkBalBranch1(wvw2225, wvw2152, wvw2153, wvw2156, Branch(wvw22240, wvw22241, wvw22242, wvw22243, wvw22244), h, ba) → new_mkBalBranch6MkBalBranch1111(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, new_sizeFM(wvw22244, h, ba), new_sizeFM(wvw22243, h, ba), h, ba)
new_primMulNat1(Zero) → Zero
new_mkBalBranch6MkBalBranch016(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, wvw229800, Zero, h, ba) → new_mkBalBranch6MkBalBranch014(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, h, ba)
new_primPlusNat0(Succ(wvw1252000), Succ(wvw1260000)) → Succ(Succ(new_primPlusNat0(wvw1252000, wvw1260000)))
new_mkBalBranch6MkBalBranch1111(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Pos(Zero), Neg(wvw23910), h, ba) → new_mkBalBranch6MkBalBranch112(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, new_primMulNat(wvw23910), h, ba)
new_mkBalBranch6MkBalBranch421(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, h, ba) → new_mkBalBranch6MkBalBranch45(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch57(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2152, wvw2153, wvw2156, Pos(Succ(Zero)), h, ba) → new_mkBalBranch6MkBalBranch58(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2152, wvw2153, wvw2156, h, ba)
new_mkBalBranch6MkBalBranch312(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Neg(Zero), Neg(wvw22950), h, ba) → new_mkBalBranch6MkBalBranch317(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, new_primMulNat1(wvw22950), h, ba)
new_primPlusNat0(Zero, Zero) → Zero
new_mkBalBranch6MkBalBranch015(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Pos(Zero), Pos(wvw22990), h, ba) → new_mkBalBranch6MkBalBranch017(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, new_primMulNat(wvw22990), h, ba)
new_mkBalBranch6MkBalBranch0110(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Succ(wvw23860), wvw229800, h, ba) → new_mkBalBranch6MkBalBranch0113(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, wvw23860, wvw229800, h, ba)
new_mkBalBranch6MkBalBranch49(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, Succ(wvw228200), h, ba) → new_mkBalBranch6MkBalBranch410(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch58(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2152, wvw2153, wvw2156, h, ba) → new_mkBranch(Zero, wvw2152, wvw2153, new_deleteMin0(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, h, ba), wvw2156, h, ba)
new_mkBalBranch6MkBalBranch317(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw23720), h, ba) → new_mkBalBranch6MkBalBranch34(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw23720, Zero, h, ba)
new_mkBalBranch6MkBalBranch412(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw22840), h, ba) → new_mkBalBranch6MkBalBranch44(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, wvw22840, h, ba)
new_primPlusInt(Neg(wvw18930), Neg(wvw18920)) → Neg(new_primPlusNat0(wvw18930, wvw18920))
new_mkBalBranch6MkBalBranch0112(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Zero, h, ba) → new_mkBalBranch6MkBalBranch012(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, h, ba)
new_primMinusNat0(Succ(wvw12860), Zero) → Pos(Succ(wvw12860))
new_sizeFM(EmptyFM, bd, be) → Pos(Zero)
new_mkBalBranch6MkBalBranch0111(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Zero, h, ba) → new_mkBalBranch6MkBalBranch012(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch015(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Pos(Succ(wvw229800)), Pos(wvw22990), h, ba) → new_mkBalBranch6MkBalBranch016(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, wvw229800, new_primMulNat(wvw22990), h, ba)
new_mkBalBranch6MkBalBranch417(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Neg(Succ(wvw224200)), h, ba) → new_mkBalBranch6MkBalBranch414(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, new_mkBalBranch6Size_l(wvw2225, wvw2152, wvw2153, wvw2156, h, ba), h, ba)
new_mkBalBranch6MkBalBranch017(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Succ(wvw23760), h, ba) → new_mkBalBranch6MkBalBranch0110(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Zero, wvw23760, h, ba)
new_mkBalBranch6MkBalBranch1113(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw239000, Zero, h, ba) → new_mkBalBranch6MkBalBranch113(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, h, ba)
new_mkBalBranch6MkBalBranch35(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw2294000), Succ(wvw236500), h, ba) → new_mkBalBranch6MkBalBranch35(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw2294000, wvw236500, h, ba)
new_mkBalBranch6MkBalBranch315(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw23670), h, ba) → new_mkBalBranch6MkBalBranch39(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, wvw23670, h, ba)
new_sizeFM(Branch(wvw18440, wvw18441, wvw18442, wvw18443, wvw18444), bd, be) → wvw18442
new_mkBalBranch6MkBalBranch417(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Neg(Zero), h, ba) → new_mkBalBranch6MkBalBranch419(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, new_mkBalBranch6Size_l(wvw2225, wvw2152, wvw2153, wvw2156, h, ba), h, ba)
new_mkBalBranch6MkBalBranch312(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Pos(Succ(wvw229400)), Neg(wvw22950), h, ba) → new_mkBalBranch6MkBalBranch314(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw229400, new_primMulNat1(wvw22950), h, ba)
new_mkBalBranch6MkBalBranch1111(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Pos(Zero), Pos(wvw23910), h, ba) → new_mkBalBranch6MkBalBranch1116(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, new_primMulNat(wvw23910), h, ba)
new_mkBalBranch6MkBalBranch54(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba) → new_mkBalBranch6MkBalBranch417(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, new_mkBalBranch6Size_r(wvw2225, wvw2152, wvw2153, wvw2156, h, ba), h, ba)
new_mkBalBranch6MkBalBranch015(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Pos(Zero), Neg(wvw22990), h, ba) → new_mkBalBranch6MkBalBranch018(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, new_primMulNat(wvw22990), h, ba)
new_mkBalBranch6MkBalBranch36(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba) → new_mkBalBranch6MkBalBranch318(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch312(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Neg(Succ(wvw229400)), Neg(wvw22950), h, ba) → new_mkBalBranch6MkBalBranch38(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw229400, new_primMulNat1(wvw22950), h, ba)
new_mkBalBranch6MkBalBranch311(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Zero, h, ba) → new_mkBalBranch6MkBalBranch37(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch33(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba) → new_mkBalBranch6MkBalBranch1(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch1114(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Zero, h, ba) → new_mkBalBranch6MkBalBranch114(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, h, ba)
new_mkBalBranch6MkBalBranch0110(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Zero, wvw229800, h, ba) → new_mkBalBranch6MkBalBranch019(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, h, ba)
new_primMulNat1(Succ(wvw215900)) → new_primPlusNat0(new_primPlusNat0(new_primPlusNat0(new_primPlusNat0(new_primMulNat0(wvw215900), Succ(wvw215900)), Succ(wvw215900)), Succ(wvw215900)), Succ(wvw215900))
new_primMinusNat0(Zero, Zero) → Pos(Zero)
new_deleteMin0(wvw21550, wvw21551, wvw21552, Branch(wvw215530, wvw215531, wvw215532, wvw215533, wvw215534), wvw21554, h, ba) → new_mkBalBranch3(wvw21550, wvw21551, wvw215530, wvw215531, wvw215532, wvw215533, wvw215534, wvw21554, h, ba)
new_mkBalBranch6MkBalBranch112(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Zero, h, ba) → new_mkBalBranch6MkBalBranch114(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, h, ba)
new_mkBalBranch6MkBalBranch015(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, Neg(Succ(wvw229800)), Neg(wvw22990), h, ba) → new_mkBalBranch6MkBalBranch0110(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, new_primMulNat(wvw22990), wvw229800, h, ba)
new_mkBalBranch6MkBalBranch312(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Pos(Succ(wvw229400)), Pos(wvw22950), h, ba) → new_mkBalBranch6MkBalBranch313(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw229400, new_primMulNat1(wvw22950), h, ba)
new_mkBalBranch6MkBalBranch419(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Neg(wvw22800), h, ba) → new_mkBalBranch6MkBalBranch47(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, new_primMulNat1(wvw22800), h, ba)
new_mkBalBranch6Size_l(wvw2225, wvw2152, wvw2153, wvw2156, h, ba) → new_sizeFM(wvw2225, h, ba)
new_mkBalBranch6MkBalBranch1111(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Pos(Succ(wvw239000)), Neg(wvw23910), h, ba) → new_mkBalBranch6MkBalBranch116(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw239000, new_primMulNat(wvw23910), h, ba)
new_mkBalBranch6MkBalBranch118(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Zero, wvw239000, h, ba) → new_mkBalBranch6MkBalBranch119(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, h, ba)
new_mkBalBranch6MkBalBranch1111(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Neg(Zero), Neg(wvw23910), h, ba) → new_mkBalBranch6MkBalBranch1117(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, new_primMulNat(wvw23910), h, ba)
new_mkBalBranch6MkBalBranch1110(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Succ(wvw2390000), Succ(wvw244600), h, ba) → new_mkBalBranch6MkBalBranch1110(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw2390000, wvw244600, h, ba)
new_mkBalBranch6MkBalBranch1110(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Zero, Succ(wvw244600), h, ba) → new_mkBalBranch6MkBalBranch119(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, h, ba)
new_mkBalBranch6MkBalBranch113(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, h, ba) → new_mkBalBranch6MkBalBranch115(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, h, ba)
new_mkBalBranch6MkBalBranch013(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, Branch(wvw215630, wvw215631, wvw215632, wvw215633, wvw215634), wvw21564, wvw2224, h, ba) → new_mkBranch(Succ(Succ(Succ(Succ(Zero)))), wvw215630, wvw215631, new_mkBranch(Succ(Succ(Succ(Succ(Succ(Zero))))), wvw2152, wvw2153, wvw2224, wvw215633, h, ba), new_mkBranch(Succ(Succ(Succ(Succ(Succ(Succ(Zero)))))), wvw21560, wvw21561, wvw215634, wvw21564, h, ba), h, ba)
new_primPlusInt(Pos(wvw18930), Pos(wvw18920)) → Pos(new_primPlusNat0(wvw18930, wvw18920))
new_mkBalBranch6MkBalBranch415(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw224200, wvw2286, h, ba) → new_mkBalBranch6MkBalBranch410(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch57(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2152, wvw2153, wvw2156, Neg(Zero), h, ba) → new_mkBalBranch6MkBalBranch58(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2152, wvw2153, wvw2156, h, ba)
new_mkBalBranch6MkBalBranch014(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, h, ba) → new_mkBalBranch6MkBalBranch013(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, wvw21563, wvw21564, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch45(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba) → new_mkBalBranch6MkBalBranch46(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch34(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw229400, Succ(wvw23650), h, ba) → new_mkBalBranch6MkBalBranch35(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw229400, wvw23650, h, ba)
new_primMulNat(Succ(wvw229900)) → new_primPlusNat0(new_primMulNat0(wvw229900), Succ(wvw229900))
new_mkBalBranch6MkBalBranch421(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw22880), h, ba) → new_mkBalBranch6MkBalBranch410(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch37(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba) → new_mkBalBranch6MkBalBranch318(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_primPlusNat0(Succ(wvw1252000), Zero) → Succ(wvw1252000)
new_primPlusNat0(Zero, Succ(wvw1260000)) → Succ(wvw1260000)
new_mkBalBranch6MkBalBranch311(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw23710), h, ba) → new_mkBalBranch6MkBalBranch36(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba)
new_mkBalBranch6MkBalBranch118(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, Succ(wvw24510), wvw239000, h, ba) → new_mkBalBranch6MkBalBranch1110(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, wvw24510, wvw239000, h, ba)
new_mkBalBranch6MkBalBranch114(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, h, ba) → new_mkBalBranch6MkBalBranch115(wvw2225, wvw2152, wvw2153, wvw2156, wvw22240, wvw22241, wvw22242, wvw22243, wvw22244, h, ba)
new_mkBalBranch6MkBalBranch46(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, h, ba) → new_mkBalBranch6MkBalBranch312(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, new_mkBalBranch6Size_l(wvw2225, wvw2152, wvw2153, wvw2156, h, ba), new_mkBalBranch6Size_r(wvw2225, wvw2152, wvw2153, wvw2156, h, ba), h, ba)
new_mkBalBranch6MkBalBranch39(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw23700), wvw229400, h, ba) → new_mkBalBranch6MkBalBranch35(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw23700, wvw229400, h, ba)
new_primMinusNat0(Succ(wvw12860), Succ(wvw128900)) → new_primMinusNat0(wvw12860, wvw128900)
new_mkBalBranch6MkBalBranch44(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, Succ(wvw22870), wvw224200, h, ba) → new_mkBalBranch6MkBalBranch49(wvw2225, wvw2152, wvw2153, wvw2156, wvw2224, wvw22870, wvw224200, h, ba)
new_mkBalBranch6MkBalBranch013(wvw2225, wvw2152, wvw2153, wvw21560, wvw21561, wvw21562, EmptyFM, wvw21564, wvw2224, h, ba) → error([])
The set Q consists of the following terms:
new_mkBalBranch6MkBalBranch48(x0, x1, x2, x3, x4, x5, Succ(x6), x7, x8)
new_mkBalBranch6MkBalBranch34(x0, x1, x2, x3, x4, x5, Succ(x6), x7, x8)
new_mkBalBranch6MkBalBranch422(x0, x1, x2, x3, x4, x5, x6, x7, x8)
new_primPlusNat0(Succ(x0), Zero)
new_mkBalBranch6MkBalBranch47(x0, x1, x2, x3, x4, Succ(x5), x6, x7)
new_primPlusNat0(Zero, Succ(x0))
new_mkBalBranch6MkBalBranch415(x0, x1, x2, x3, x4, x5, x6, x7, x8)
new_mkBalBranch6MkBalBranch1111(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(Zero), Neg(x9), x10, x11)
new_mkBalBranch6MkBalBranch0112(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6MkBalBranch315(x0, x1, x2, x3, x4, Succ(x5), x6, x7)
new_mkBalBranch6MkBalBranch312(x0, x1, x2, x3, x4, Neg(Zero), Neg(x5), x6, x7)
new_primMulNat(Zero)
new_mkBalBranch6MkBalBranch54(x0, x1, x2, x3, x4, x5, x6)
new_mkBalBranch6MkBalBranch37(x0, x1, x2, x3, x4, x5, x6)
new_mkBalBranch6MkBalBranch117(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12)
new_mkBalBranch6MkBalBranch017(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6MkBalBranch420(x0, x1, x2, x3, x4, x5, x6, x7, x8)
new_mkBalBranch6MkBalBranch0(x0, x1, x2, EmptyFM, x3, x4, x5)
new_mkBalBranch6MkBalBranch1116(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_ps(x0, x1)
new_mkBalBranch6MkBalBranch34(x0, x1, x2, x3, x4, x5, Zero, x6, x7)
new_primMinusNat0(Zero, Zero)
new_mkBalBranch6MkBalBranch49(x0, x1, x2, x3, x4, Succ(x5), Zero, x6, x7)
new_mkBalBranch6MkBalBranch1117(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch013(x0, x1, x2, x3, x4, x5, EmptyFM, x6, x7, x8, x9)
new_sizeFM(EmptyFM, x0, x1)
new_primPlusInt(Pos(x0), Pos(x1))
new_mkBalBranch6MkBalBranch35(x0, x1, x2, x3, x4, Succ(x5), Zero, x6, x7)
new_mkBalBranch6MkBalBranch0(x0, x1, x2, Branch(x3, x4, x5, x6, x7), x8, x9, x10)
new_mkBalBranch6MkBalBranch46(x0, x1, x2, x3, x4, x5, x6)
new_mkBalBranch6MkBalBranch317(x0, x1, x2, x3, x4, Succ(x5), x6, x7)
new_mkBalBranch6MkBalBranch0111(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6MkBalBranch58(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9)
new_mkBalBranch6MkBalBranch49(x0, x1, x2, x3, x4, Zero, Succ(x5), x6, x7)
new_mkBalBranch6MkBalBranch015(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(Succ(x9)), Pos(x10), x11, x12)
new_primPlusInt(Neg(x0), Neg(x1))
new_mkBalBranch6MkBalBranch43(x0, x1, x2, x3, x4, x5, x6, x7, x8)
new_mkBalBranch6MkBalBranch315(x0, x1, x2, x3, x4, Zero, x5, x6)
new_mkBalBranch6MkBalBranch015(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(Zero), Neg(x9), x10, x11)
new_mkBranch(x0, x1, x2, x3, x4, x5, x6)
new_mkBalBranch6MkBalBranch1110(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), Succ(x10), x11, x12)
new_mkBalBranch6MkBalBranch57(x0, x1, x2, x3, x4, x5, x6, x7, Pos(Succ(Succ(x8))), x9, x10)
new_primMinusNat0(Succ(x0), Succ(x1))
new_primMinusNat0(Succ(x0), Zero)
new_mkBalBranch6MkBalBranch1110(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), Zero, x10, x11)
new_mkBalBranch6MkBalBranch35(x0, x1, x2, x3, x4, Zero, Succ(x5), x6, x7)
new_deleteMin0(x0, x1, x2, EmptyFM, x3, x4, x5)
new_mkBalBranch6MkBalBranch018(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6MkBalBranch115(x0, x1, x2, x3, x4, x5, x6, x7, Branch(x8, x9, x10, x11, x12), x13, x14)
new_mkBalBranch6MkBalBranch1111(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(Succ(x9)), Pos(x10), x11, x12)
new_mkBalBranch6MkBalBranch0113(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), Succ(x10), x11, x12)
new_mkBalBranch6MkBalBranch38(x0, x1, x2, x3, x4, x5, x6, x7, x8)
new_mkBalBranch6MkBalBranch115(x0, x1, x2, x3, x4, x5, x6, x7, EmptyFM, x8, x9)
new_mkBalBranch6MkBalBranch45(x0, x1, x2, x3, x4, x5, x6)
new_mkBalBranch6MkBalBranch017(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch412(x0, x1, x2, x3, x4, Zero, x5, x6)
new_mkBalBranch6MkBalBranch316(x0, x1, x2, x3, x4, Succ(x5), x6, x7)
new_mkBalBranch6MkBalBranch1111(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(Zero), Neg(x9), x10, x11)
new_mkBalBranch6MkBalBranch1111(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(Zero), Pos(x9), x10, x11)
new_mkBalBranch6MkBalBranch33(x0, x1, x2, x3, x4, x5, x6)
new_mkBalBranch6MkBalBranch113(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)
new_mkBalBranch6MkBalBranch119(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)
new_mkBalBranch6MkBalBranch44(x0, x1, x2, x3, x4, Succ(x5), x6, x7, x8)
new_mkBalBranch6MkBalBranch47(x0, x1, x2, x3, x4, Zero, x5, x6)
new_mkBalBranch6MkBalBranch312(x0, x1, x2, x3, x4, Neg(Succ(x5)), Neg(x6), x7, x8)
new_mkBalBranch6MkBalBranch417(x0, x1, x2, x3, x4, Neg(Zero), x5, x6)
new_mkBalBranch6MkBalBranch39(x0, x1, x2, x3, x4, Zero, x5, x6, x7)
new_mkBalBranch6MkBalBranch57(x0, x1, x2, x3, x4, x5, x6, x7, Pos(Succ(Zero)), x8, x9)
new_mkBalBranch6MkBalBranch1117(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6MkBalBranch414(x0, x1, x2, x3, x4, x5, Neg(x6), x7, x8)
new_mkBalBranch6MkBalBranch016(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, Succ(x10), x11, x12)
new_mkBalBranch6MkBalBranch015(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(Succ(x9)), Neg(x10), x11, x12)
new_mkBalBranch6MkBalBranch015(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(Succ(x9)), Pos(x10), x11, x12)
new_mkBranchUnbox(x0, x1, x2, x3, x4, x5)
new_mkBalBranch6MkBalBranch0112(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch118(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11, x12)
new_mkBalBranch6MkBalBranch417(x0, x1, x2, x3, x4, Pos(Succ(x5)), x6, x7)
new_mkBalBranch6Size_r(x0, x1, x2, x3, x4, x5)
new_mkBalBranch6MkBalBranch310(x0, x1, x2, x3, x4, x5, x6, x7, x8)
new_mkBalBranch6MkBalBranch1111(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(Succ(x9)), Neg(x10), x11, x12)
new_mkBalBranch6MkBalBranch1111(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(Succ(x9)), Pos(x10), x11, x12)
new_mkBalBranch6MkBalBranch112(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6Size_l(x0, x1, x2, x3, x4, x5)
new_mkBalBranch6MkBalBranch316(x0, x1, x2, x3, x4, Zero, x5, x6)
new_mkBalBranch6MkBalBranch57(x0, x1, x2, x3, x4, x5, x6, x7, Pos(Zero), x8, x9)
new_mkBalBranch6MkBalBranch314(x0, x1, x2, x3, x4, x5, x6, x7, x8)
new_mkBalBranch6MkBalBranch311(x0, x1, x2, x3, x4, Succ(x5), x6, x7)
new_mkBalBranch6MkBalBranch417(x0, x1, x2, x3, x4, Neg(Succ(x5)), x6, x7)
new_mkBalBranch6MkBalBranch413(x0, x1, x2, x3, x4, Zero, x5, x6)
new_mkBalBranch6MkBalBranch313(x0, x1, x2, x3, x4, x5, x6, x7, x8)
new_primPlusNat0(Succ(x0), Succ(x1))
new_deleteMin0(x0, x1, x2, Branch(x3, x4, x5, x6, x7), x8, x9, x10)
new_mkBalBranch6MkBalBranch013(x0, x1, x2, x3, x4, x5, Branch(x6, x7, x8, x9, x10), x11, x12, x13, x14)
new_mkBalBranch6MkBalBranch1(x0, x1, x2, x3, EmptyFM, x4, x5)
new_mkBalBranch6MkBalBranch1114(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch1114(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_primMulNat(Succ(x0))
new_primMulNat1(Succ(x0))
new_mkBalBranch6MkBalBranch1111(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(Zero), Pos(x9), x10, x11)
new_primMulNat1(Zero)
new_mkBalBranch6MkBalBranch410(x0, x1, x2, x3, x4, x5, x6)
new_mkBalBranch6MkBalBranch0113(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, Zero, x9, x10)
new_mkBalBranch6MkBalBranch49(x0, x1, x2, x3, x4, Succ(x5), Succ(x6), x7, x8)
new_mkBalBranch6MkBalBranch0110(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11, x12)
new_mkBalBranch6MkBalBranch018(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch317(x0, x1, x2, x3, x4, Zero, x5, x6)
new_mkBalBranch6MkBalBranch35(x0, x1, x2, x3, x4, Zero, Zero, x5, x6)
new_mkBalBranch6MkBalBranch318(x0, x1, x2, x3, x4, x5, x6)
new_mkBalBranch6MkBalBranch418(x0, x1, x2, x3, x4, x5, Pos(x6), x7, x8)
new_mkBalBranch6MkBalBranch412(x0, x1, x2, x3, x4, Succ(x5), x6, x7)
new_mkBalBranch6MkBalBranch44(x0, x1, x2, x3, x4, Zero, x5, x6, x7)
new_primPlusInt(Pos(x0), Neg(x1))
new_primPlusInt(Neg(x0), Pos(x1))
new_primMinusNat0(Zero, Succ(x0))
new_primPlusNat0(Zero, Zero)
new_mkBalBranch3(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9)
new_primMulNat0(x0)
new_mkBalBranch6MkBalBranch112(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch1116(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10)
new_mkBalBranch6MkBalBranch419(x0, x1, x2, x3, x4, Neg(x5), x6, x7)
new_mkBalBranch6MkBalBranch0111(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch114(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)
new_mkBalBranch6MkBalBranch1113(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, Zero, x10, x11)
new_mkBalBranch6MkBalBranch1110(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch0113(x0, x1, x2, x3, x4, x5, x6, x7, x8, Succ(x9), Zero, x10, x11)
new_mkBalBranch6MkBalBranch49(x0, x1, x2, x3, x4, Zero, Zero, x5, x6)
new_mkBalBranch6MkBalBranch312(x0, x1, x2, x3, x4, Pos(Succ(x5)), Pos(x6), x7, x8)
new_mkBalBranch6MkBalBranch014(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)
new_mkBalBranch6MkBalBranch411(x0, x1, x2, x3, x4, Pos(x5), x6, x7)
new_mkBalBranch6MkBalBranch413(x0, x1, x2, x3, x4, Succ(x5), x6, x7)
new_mkBalBranch6MkBalBranch312(x0, x1, x2, x3, x4, Pos(Zero), Pos(x5), x6, x7)
new_mkBalBranch6MkBalBranch57(x0, x1, x2, x3, x4, x5, x6, x7, Neg(Succ(x8)), x9, x10)
new_mkBalBranch6MkBalBranch419(x0, x1, x2, x3, x4, Pos(x5), x6, x7)
new_mkBalBranch6MkBalBranch015(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(Zero), Pos(x9), x10, x11)
new_mkBalBranch6MkBalBranch1113(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, Succ(x10), x11, x12)
new_mkBalBranch6MkBalBranch48(x0, x1, x2, x3, x4, x5, Zero, x6, x7)
new_mkBalBranch6MkBalBranch1110(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, Zero, x9, x10)
new_mkBalBranch6MkBalBranch015(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(Succ(x9)), Neg(x10), x11, x12)
new_mkBalBranch6MkBalBranch1115(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12)
new_mkBalBranch6MkBalBranch0113(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, Succ(x9), x10, x11)
new_mkBalBranch6MkBalBranch53(x0, x1, x2, x3, x4, Succ(x5), x6, x7)
new_mkBalBranch6MkBalBranch012(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)
new_mkBalBranch6MkBalBranch116(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12)
new_mkBalBranch6MkBalBranch35(x0, x1, x2, x3, x4, Succ(x5), Succ(x6), x7, x8)
new_mkBalBranch6MkBalBranch57(x0, x1, x2, x3, x4, x5, x6, x7, Neg(Zero), x8, x9)
new_mkBalBranch6MkBalBranch015(x0, x1, x2, x3, x4, x5, x6, x7, x8, Pos(Zero), Neg(x9), x10, x11)
new_mkBalBranch6MkBalBranch015(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(Zero), Pos(x9), x10, x11)
new_mkBalBranch6MkBalBranch118(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10, x11)
new_mkBalBranch6MkBalBranch312(x0, x1, x2, x3, x4, Neg(Zero), Pos(x5), x6, x7)
new_mkBalBranch6MkBalBranch312(x0, x1, x2, x3, x4, Pos(Zero), Neg(x5), x6, x7)
new_mkBalBranch6MkBalBranch019(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10)
new_sizeFM(Branch(x0, x1, x2, x3, x4), x5, x6)
new_mkBalBranch6MkBalBranch1111(x0, x1, x2, x3, x4, x5, x6, x7, x8, Neg(Succ(x9)), Neg(x10), x11, x12)
new_mkBalBranch6MkBalBranch421(x0, x1, x2, x3, x4, Succ(x5), x6, x7)
new_mkBalBranch6MkBalBranch421(x0, x1, x2, x3, x4, Zero, x5, x6)
new_mkBalBranch6MkBalBranch016(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, Zero, x10, x11)
new_mkBalBranch6MkBalBranch416(x0, x1, x2, x3, x4, x5, x6)
new_mkBalBranch6MkBalBranch414(x0, x1, x2, x3, x4, x5, Pos(x6), x7, x8)
new_mkBalBranch6MkBalBranch36(x0, x1, x2, x3, x4, x5, x6)
new_mkBalBranch6MkBalBranch1(x0, x1, x2, x3, Branch(x4, x5, x6, x7, x8), x9, x10)
new_mkBalBranch6MkBalBranch417(x0, x1, x2, x3, x4, Pos(Zero), x5, x6)
new_mkBalBranch6MkBalBranch311(x0, x1, x2, x3, x4, Zero, x5, x6)
new_mkBalBranch6MkBalBranch39(x0, x1, x2, x3, x4, Succ(x5), x6, x7, x8)
new_mkBalBranch6MkBalBranch1112(x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12)
new_mkBalBranch6MkBalBranch312(x0, x1, x2, x3, x4, Pos(Succ(x5)), Neg(x6), x7, x8)
new_mkBalBranch6MkBalBranch312(x0, x1, x2, x3, x4, Neg(Succ(x5)), Pos(x6), x7, x8)
new_mkBalBranch6MkBalBranch0110(x0, x1, x2, x3, x4, x5, x6, x7, x8, Zero, x9, x10, x11)
new_mkBalBranch6MkBalBranch418(x0, x1, x2, x3, x4, x5, Neg(x6), x7, x8)
new_mkBalBranch6MkBalBranch53(x0, x1, x2, x3, x4, Zero, x5, x6)
new_mkBalBranch6MkBalBranch411(x0, x1, x2, x3, x4, Neg(x5), x6, x7)
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_deleteMin(wvw21550, wvw21551, wvw21552, Branch(wvw215530, wvw215531, wvw215532, wvw215533, wvw215534), wvw21554, h, ba) → new_mkBalBranch2(wvw21550, wvw21551, wvw215530, wvw215531, wvw215532, wvw215533, wvw215534, wvw21554, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 4 > 3, 4 > 4, 4 > 5, 4 > 6, 4 > 7, 5 >= 8, 6 >= 9, 7 >= 10
- new_mkBalBranch2(wvw2152, wvw2153, wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2156, h, ba) → new_mkBalBranch6MkBalBranch55(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2152, wvw2153, wvw2156, new_ps(new_sizeFM(new_deleteMin0(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, h, ba), h, ba), new_sizeFM(wvw2156, h, ba)), h, ba)
The graph contains the following edges 3 >= 1, 4 >= 2, 5 >= 3, 6 >= 4, 7 >= 5, 1 >= 6, 2 >= 7, 8 >= 8, 9 >= 10, 10 >= 11
- new_mkBalBranch2(wvw2152, wvw2153, wvw21550, wvw21551, wvw21552, Branch(wvw215530, wvw215531, wvw215532, wvw215533, wvw215534), wvw21554, wvw2156, h, ba) → new_mkBalBranch2(wvw21550, wvw21551, wvw215530, wvw215531, wvw215532, wvw215533, wvw215534, wvw21554, h, ba)
The graph contains the following edges 3 >= 1, 4 >= 2, 6 > 3, 6 > 4, 6 > 5, 6 > 6, 6 > 7, 7 >= 8, 9 >= 9, 10 >= 10
- new_mkBalBranch6MkBalBranch56(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2152, wvw2153, wvw2156, h, ba) → new_deleteMin(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 9 >= 6, 10 >= 7
- new_mkBalBranch6MkBalBranch55(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2152, wvw2153, wvw2156, Pos(Zero), h, ba) → new_mkBalBranch6MkBalBranch56(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2152, wvw2153, wvw2156, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 10 >= 9, 11 >= 10
- new_mkBalBranch6MkBalBranch55(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2152, wvw2153, wvw2156, Neg(Zero), h, ba) → new_mkBalBranch6MkBalBranch56(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2152, wvw2153, wvw2156, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 10 >= 9, 11 >= 10
- new_mkBalBranch6MkBalBranch55(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2152, wvw2153, wvw2156, Pos(Succ(Zero)), h, ba) → new_mkBalBranch6MkBalBranch56(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2152, wvw2153, wvw2156, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 10 >= 9, 11 >= 10
- new_mkBalBranch6MkBalBranch55(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2152, wvw2153, wvw2156, Pos(Succ(Succ(wvw2208000))), h, ba) → new_deleteMin(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 10 >= 6, 11 >= 7
- new_mkBalBranch6MkBalBranch55(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, wvw2152, wvw2153, wvw2156, Neg(Succ(wvw220800)), h, ba) → new_deleteMin(wvw21550, wvw21551, wvw21552, wvw21553, wvw21554, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 10 >= 6, 11 >= 7
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch4(wvw340, wvw341, wvw3430, wvw3431, wvw3432, wvw3433, wvw3434, wvw344, h) → new_deleteMin1(wvw3430, wvw3431, wvw3432, wvw3433, wvw3434, h)
new_deleteMin1(wvw3430, wvw3431, wvw3432, Branch(wvw34330, wvw34331, wvw34332, wvw34333, wvw34334), wvw3434, h) → new_mkBalBranch4(wvw3430, wvw3431, wvw34330, wvw34331, wvw34332, wvw34333, wvw34334, wvw3434, h)
new_mkBalBranch4(wvw340, wvw341, wvw3430, wvw3431, wvw3432, Branch(wvw34330, wvw34331, wvw34332, wvw34333, wvw34334), wvw3434, wvw344, h) → new_mkBalBranch4(wvw3430, wvw3431, wvw34330, wvw34331, wvw34332, wvw34333, wvw34334, wvw3434, h)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_deleteMin1(wvw3430, wvw3431, wvw3432, Branch(wvw34330, wvw34331, wvw34332, wvw34333, wvw34334), wvw3434, h) → new_mkBalBranch4(wvw3430, wvw3431, wvw34330, wvw34331, wvw34332, wvw34333, wvw34334, wvw3434, h)
The graph contains the following edges 1 >= 1, 2 >= 2, 4 > 3, 4 > 4, 4 > 5, 4 > 6, 4 > 7, 5 >= 8, 6 >= 9
- new_mkBalBranch4(wvw340, wvw341, wvw3430, wvw3431, wvw3432, Branch(wvw34330, wvw34331, wvw34332, wvw34333, wvw34334), wvw3434, wvw344, h) → new_mkBalBranch4(wvw3430, wvw3431, wvw34330, wvw34331, wvw34332, wvw34333, wvw34334, wvw3434, h)
The graph contains the following edges 3 >= 1, 4 >= 2, 6 > 3, 6 > 4, 6 > 5, 6 > 6, 6 > 7, 7 >= 8, 9 >= 9
- new_mkBalBranch4(wvw340, wvw341, wvw3430, wvw3431, wvw3432, wvw3433, wvw3434, wvw344, h) → new_deleteMin1(wvw3430, wvw3431, wvw3432, wvw3433, wvw3434, h)
The graph contains the following edges 3 >= 1, 4 >= 2, 5 >= 3, 6 >= 4, 7 >= 5, 9 >= 6
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2GlueBal1(wvw2164, wvw2165, wvw2166, wvw2167, wvw2168, wvw2169, wvw2170, wvw2171, wvw2172, wvw2173, Succ(wvw21740), Succ(wvw21750), h, ba) → new_glueBal2GlueBal1(wvw2164, wvw2165, wvw2166, wvw2167, wvw2168, wvw2169, wvw2170, wvw2171, wvw2172, wvw2173, wvw21740, wvw21750, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2GlueBal1(wvw2164, wvw2165, wvw2166, wvw2167, wvw2168, wvw2169, wvw2170, wvw2171, wvw2172, wvw2173, Succ(wvw21740), Succ(wvw21750), h, ba) → new_glueBal2GlueBal1(wvw2164, wvw2165, wvw2166, wvw2167, wvw2168, wvw2169, wvw2170, wvw2171, wvw2172, wvw2173, wvw21740, wvw21750, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 11 > 11, 12 > 12, 13 >= 13, 14 >= 14
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_glueBal2GlueBal10(wvw2147, wvw2148, wvw2149, wvw2150, wvw2151, wvw2152, wvw2153, wvw2154, wvw2155, wvw2156, Succ(wvw21570), Succ(wvw21580), h, ba) → new_glueBal2GlueBal10(wvw2147, wvw2148, wvw2149, wvw2150, wvw2151, wvw2152, wvw2153, wvw2154, wvw2155, wvw2156, wvw21570, wvw21580, h, ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_glueBal2GlueBal10(wvw2147, wvw2148, wvw2149, wvw2150, wvw2151, wvw2152, wvw2153, wvw2154, wvw2155, wvw2156, Succ(wvw21570), Succ(wvw21580), h, ba) → new_glueBal2GlueBal10(wvw2147, wvw2148, wvw2149, wvw2150, wvw2151, wvw2152, wvw2153, wvw2154, wvw2155, wvw2156, wvw21570, wvw21580, h, ba)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 7, 8 >= 8, 9 >= 9, 10 >= 10, 11 > 11, 12 > 12, 13 >= 13, 14 >= 14
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_mkBalBranch6MkBalBranch59(wvw1251, wvw340, wvw341, wvw344, wvw1250, Succ(wvw125200), Succ(wvw125900), h) → new_mkBalBranch6MkBalBranch59(wvw1251, wvw340, wvw341, wvw344, wvw1250, wvw125200, wvw125900, h)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_mkBalBranch6MkBalBranch59(wvw1251, wvw340, wvw341, wvw344, wvw1250, Succ(wvw125200), Succ(wvw125900), h) → new_mkBalBranch6MkBalBranch59(wvw1251, wvw340, wvw341, wvw344, wvw1250, wvw125200, wvw125900, h)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 > 6, 7 > 7, 8 >= 8
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_delFromFM0(wvw1536, wvw1537, wvw1538, wvw1539, wvw1540, wvw1541, Succ(wvw15420), Succ(wvw15430), h) → new_delFromFM0(wvw1536, wvw1537, wvw1538, wvw1539, wvw1540, wvw1541, wvw15420, wvw15430, h)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_delFromFM0(wvw1536, wvw1537, wvw1538, wvw1539, wvw1540, wvw1541, Succ(wvw15420), Succ(wvw15430), h) → new_delFromFM0(wvw1536, wvw1537, wvw1538, wvw1539, wvw1540, wvw1541, wvw15420, wvw15430, h)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 > 7, 8 > 8, 9 >= 9
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_delFromFM00(wvw1421, wvw1422, wvw1423, wvw1424, wvw1425, wvw1426, Succ(wvw14270), Succ(wvw14280), h) → new_delFromFM00(wvw1421, wvw1422, wvw1423, wvw1424, wvw1425, wvw1426, wvw14270, wvw14280, h)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_delFromFM00(wvw1421, wvw1422, wvw1423, wvw1424, wvw1425, wvw1426, Succ(wvw14270), Succ(wvw14280), h) → new_delFromFM00(wvw1421, wvw1422, wvw1423, wvw1424, wvw1425, wvw1426, wvw14270, wvw14280, h)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 > 7, 8 > 8, 9 >= 9
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ DependencyGraphProof
Q DP problem:
The TRS P consists of the following rules:
new_delFromFM21(wvw121, wvw122, wvw123, wvw124, wvw125, wvw126, Zero, Zero, bb) → new_delFromFM22(wvw121, wvw122, wvw123, wvw124, wvw125, wvw126, bb)
new_delFromFM20(wvw112, wvw113, wvw114, wvw115, wvw116, wvw117, h) → new_delFromFM1(wvw112, wvw113, wvw114, wvw115, wvw116, wvw117, Succ(wvw117), Succ(wvw112), h)
new_delFromFM2(wvw112, wvw113, wvw114, wvw115, wvw116, wvw117, Succ(wvw1180), Zero, h) → new_delFromFM(wvw116, Pos(Succ(wvw117)), h)
new_delFromFM(Branch(Pos(Succ(wvw3000)), wvw31, wvw32, wvw33, wvw34), Pos(Zero), ba) → new_delFromFM(wvw33, Pos(Zero), ba)
new_delFromFM(Branch(Neg(Succ(wvw3000)), wvw31, wvw32, wvw33, wvw34), Pos(Zero), ba) → new_delFromFM(wvw34, Pos(Zero), ba)
new_delFromFM21(wvw121, wvw122, wvw123, wvw124, wvw125, wvw126, Succ(wvw1270), Zero, bb) → new_delFromFM(wvw125, Neg(Succ(wvw126)), bb)
new_delFromFM10(wvw305, wvw306, wvw307, wvw308, wvw309, wvw310, Zero, Succ(wvw3120), bc) → new_delFromFM(wvw308, Neg(Succ(wvw310)), bc)
new_delFromFM2(wvw112, wvw113, wvw114, wvw115, wvw116, wvw117, Succ(wvw1180), Succ(wvw1190), h) → new_delFromFM2(wvw112, wvw113, wvw114, wvw115, wvw116, wvw117, wvw1180, wvw1190, h)
new_delFromFM(Branch(Pos(Zero), wvw31, wvw32, wvw33, wvw34), Pos(Succ(wvw400)), ba) → new_delFromFM(wvw34, Pos(Succ(wvw400)), ba)
new_delFromFM1(wvw392, wvw393, wvw394, wvw395, wvw396, wvw397, Zero, Succ(wvw3990), bd) → new_delFromFM(wvw395, Pos(Succ(wvw397)), bd)
new_delFromFM2(wvw112, wvw113, wvw114, wvw115, wvw116, wvw117, Zero, Succ(wvw1190), h) → new_delFromFM1(wvw112, wvw113, wvw114, wvw115, wvw116, wvw117, Succ(wvw117), Succ(wvw112), h)
new_delFromFM(Branch(Neg(Zero), wvw31, wvw32, wvw33, wvw34), Neg(Succ(wvw400)), ba) → new_delFromFM(wvw33, Neg(Succ(wvw400)), ba)
new_delFromFM(Branch(Pos(Succ(wvw3000)), wvw31, wvw32, wvw33, wvw34), Neg(Zero), ba) → new_delFromFM(wvw33, Neg(Zero), ba)
new_delFromFM(Branch(Pos(wvw300), wvw31, wvw32, wvw33, wvw34), Neg(Succ(wvw400)), ba) → new_delFromFM(wvw33, Neg(Succ(wvw400)), ba)
new_delFromFM2(wvw112, wvw113, wvw114, wvw115, wvw116, wvw117, Zero, Zero, h) → new_delFromFM20(wvw112, wvw113, wvw114, wvw115, wvw116, wvw117, h)
new_delFromFM(Branch(Neg(Succ(wvw3000)), wvw31, wvw32, wvw33, wvw34), Neg(Zero), ba) → new_delFromFM(wvw34, Neg(Zero), ba)
new_delFromFM21(wvw121, wvw122, wvw123, wvw124, wvw125, wvw126, Zero, Succ(wvw1280), bb) → new_delFromFM10(wvw121, wvw122, wvw123, wvw124, wvw125, wvw126, Succ(wvw121), Succ(wvw126), bb)
new_delFromFM22(wvw121, wvw122, wvw123, wvw124, wvw125, wvw126, bb) → new_delFromFM10(wvw121, wvw122, wvw123, wvw124, wvw125, wvw126, Succ(wvw121), Succ(wvw126), bb)
new_delFromFM1(wvw392, wvw393, wvw394, wvw395, wvw396, wvw397, Succ(wvw3980), Succ(wvw3990), bd) → new_delFromFM1(wvw392, wvw393, wvw394, wvw395, wvw396, wvw397, wvw3980, wvw3990, bd)
new_delFromFM(Branch(Neg(Succ(wvw3000)), wvw31, wvw32, wvw33, wvw34), Neg(Succ(wvw400)), ba) → new_delFromFM21(wvw3000, wvw31, wvw32, wvw33, wvw34, wvw400, wvw3000, wvw400, ba)
new_delFromFM(Branch(Pos(Succ(wvw3000)), wvw31, wvw32, wvw33, wvw34), Pos(Succ(wvw400)), ba) → new_delFromFM2(wvw3000, wvw31, wvw32, wvw33, wvw34, wvw400, wvw400, wvw3000, ba)
new_delFromFM10(wvw305, wvw306, wvw307, wvw308, wvw309, wvw310, Succ(wvw3110), Succ(wvw3120), bc) → new_delFromFM10(wvw305, wvw306, wvw307, wvw308, wvw309, wvw310, wvw3110, wvw3120, bc)
new_delFromFM(Branch(Neg(wvw300), wvw31, wvw32, wvw33, wvw34), Pos(Succ(wvw400)), ba) → new_delFromFM(wvw34, Pos(Succ(wvw400)), ba)
new_delFromFM21(wvw121, wvw122, wvw123, wvw124, wvw125, wvw126, Succ(wvw1270), Succ(wvw1280), bb) → new_delFromFM21(wvw121, wvw122, wvw123, wvw124, wvw125, wvw126, wvw1270, wvw1280, bb)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 4 SCCs.
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_delFromFM(Branch(Neg(Succ(wvw3000)), wvw31, wvw32, wvw33, wvw34), Neg(Zero), ba) → new_delFromFM(wvw34, Neg(Zero), ba)
new_delFromFM(Branch(Pos(Succ(wvw3000)), wvw31, wvw32, wvw33, wvw34), Neg(Zero), ba) → new_delFromFM(wvw33, Neg(Zero), ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_delFromFM(Branch(Pos(Succ(wvw3000)), wvw31, wvw32, wvw33, wvw34), Neg(Zero), ba) → new_delFromFM(wvw33, Neg(Zero), ba)
The graph contains the following edges 1 > 1, 2 >= 2, 3 >= 3
- new_delFromFM(Branch(Neg(Succ(wvw3000)), wvw31, wvw32, wvw33, wvw34), Neg(Zero), ba) → new_delFromFM(wvw34, Neg(Zero), ba)
The graph contains the following edges 1 > 1, 2 >= 2, 3 >= 3
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_delFromFM(Branch(Pos(Succ(wvw3000)), wvw31, wvw32, wvw33, wvw34), Pos(Zero), ba) → new_delFromFM(wvw33, Pos(Zero), ba)
new_delFromFM(Branch(Neg(Succ(wvw3000)), wvw31, wvw32, wvw33, wvw34), Pos(Zero), ba) → new_delFromFM(wvw34, Pos(Zero), ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_delFromFM(Branch(Neg(Succ(wvw3000)), wvw31, wvw32, wvw33, wvw34), Pos(Zero), ba) → new_delFromFM(wvw34, Pos(Zero), ba)
The graph contains the following edges 1 > 1, 2 >= 2, 3 >= 3
- new_delFromFM(Branch(Pos(Succ(wvw3000)), wvw31, wvw32, wvw33, wvw34), Pos(Zero), ba) → new_delFromFM(wvw33, Pos(Zero), ba)
The graph contains the following edges 1 > 1, 2 >= 2, 3 >= 3
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
new_delFromFM20(wvw112, wvw113, wvw114, wvw115, wvw116, wvw117, h) → new_delFromFM1(wvw112, wvw113, wvw114, wvw115, wvw116, wvw117, Succ(wvw117), Succ(wvw112), h)
new_delFromFM2(wvw112, wvw113, wvw114, wvw115, wvw116, wvw117, Succ(wvw1180), Zero, h) → new_delFromFM(wvw116, Pos(Succ(wvw117)), h)
new_delFromFM2(wvw112, wvw113, wvw114, wvw115, wvw116, wvw117, Succ(wvw1180), Succ(wvw1190), h) → new_delFromFM2(wvw112, wvw113, wvw114, wvw115, wvw116, wvw117, wvw1180, wvw1190, h)
new_delFromFM(Branch(Pos(Zero), wvw31, wvw32, wvw33, wvw34), Pos(Succ(wvw400)), ba) → new_delFromFM(wvw34, Pos(Succ(wvw400)), ba)
new_delFromFM2(wvw112, wvw113, wvw114, wvw115, wvw116, wvw117, Zero, Succ(wvw1190), h) → new_delFromFM1(wvw112, wvw113, wvw114, wvw115, wvw116, wvw117, Succ(wvw117), Succ(wvw112), h)
new_delFromFM1(wvw392, wvw393, wvw394, wvw395, wvw396, wvw397, Zero, Succ(wvw3990), bd) → new_delFromFM(wvw395, Pos(Succ(wvw397)), bd)
new_delFromFM2(wvw112, wvw113, wvw114, wvw115, wvw116, wvw117, Zero, Zero, h) → new_delFromFM20(wvw112, wvw113, wvw114, wvw115, wvw116, wvw117, h)
new_delFromFM1(wvw392, wvw393, wvw394, wvw395, wvw396, wvw397, Succ(wvw3980), Succ(wvw3990), bd) → new_delFromFM1(wvw392, wvw393, wvw394, wvw395, wvw396, wvw397, wvw3980, wvw3990, bd)
new_delFromFM(Branch(Pos(Succ(wvw3000)), wvw31, wvw32, wvw33, wvw34), Pos(Succ(wvw400)), ba) → new_delFromFM2(wvw3000, wvw31, wvw32, wvw33, wvw34, wvw400, wvw400, wvw3000, ba)
new_delFromFM(Branch(Neg(wvw300), wvw31, wvw32, wvw33, wvw34), Pos(Succ(wvw400)), ba) → new_delFromFM(wvw34, Pos(Succ(wvw400)), ba)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_delFromFM1(wvw392, wvw393, wvw394, wvw395, wvw396, wvw397, Succ(wvw3980), Succ(wvw3990), bd) → new_delFromFM1(wvw392, wvw393, wvw394, wvw395, wvw396, wvw397, wvw3980, wvw3990, bd)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 > 7, 8 > 8, 9 >= 9
- new_delFromFM1(wvw392, wvw393, wvw394, wvw395, wvw396, wvw397, Zero, Succ(wvw3990), bd) → new_delFromFM(wvw395, Pos(Succ(wvw397)), bd)
The graph contains the following edges 4 >= 1, 9 >= 3
- new_delFromFM(Branch(Pos(Succ(wvw3000)), wvw31, wvw32, wvw33, wvw34), Pos(Succ(wvw400)), ba) → new_delFromFM2(wvw3000, wvw31, wvw32, wvw33, wvw34, wvw400, wvw400, wvw3000, ba)
The graph contains the following edges 1 > 1, 1 > 2, 1 > 3, 1 > 4, 1 > 5, 2 > 6, 2 > 7, 1 > 8, 3 >= 9
- new_delFromFM2(wvw112, wvw113, wvw114, wvw115, wvw116, wvw117, Succ(wvw1180), Zero, h) → new_delFromFM(wvw116, Pos(Succ(wvw117)), h)
The graph contains the following edges 5 >= 1, 9 >= 3
- new_delFromFM2(wvw112, wvw113, wvw114, wvw115, wvw116, wvw117, Zero, Succ(wvw1190), h) → new_delFromFM1(wvw112, wvw113, wvw114, wvw115, wvw116, wvw117, Succ(wvw117), Succ(wvw112), h)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 9 >= 9
- new_delFromFM20(wvw112, wvw113, wvw114, wvw115, wvw116, wvw117, h) → new_delFromFM1(wvw112, wvw113, wvw114, wvw115, wvw116, wvw117, Succ(wvw117), Succ(wvw112), h)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 9
- new_delFromFM2(wvw112, wvw113, wvw114, wvw115, wvw116, wvw117, Succ(wvw1180), Succ(wvw1190), h) → new_delFromFM2(wvw112, wvw113, wvw114, wvw115, wvw116, wvw117, wvw1180, wvw1190, h)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 > 7, 8 > 8, 9 >= 9
- new_delFromFM2(wvw112, wvw113, wvw114, wvw115, wvw116, wvw117, Zero, Zero, h) → new_delFromFM20(wvw112, wvw113, wvw114, wvw115, wvw116, wvw117, h)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 9 >= 7
- new_delFromFM(Branch(Pos(Zero), wvw31, wvw32, wvw33, wvw34), Pos(Succ(wvw400)), ba) → new_delFromFM(wvw34, Pos(Succ(wvw400)), ba)
The graph contains the following edges 1 > 1, 2 >= 2, 3 >= 3
- new_delFromFM(Branch(Neg(wvw300), wvw31, wvw32, wvw33, wvw34), Pos(Succ(wvw400)), ba) → new_delFromFM(wvw34, Pos(Succ(wvw400)), ba)
The graph contains the following edges 1 > 1, 2 >= 2, 3 >= 3
↳ HASKELL
↳ LR
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ LetRed
↳ HASKELL
↳ NumRed
↳ HASKELL
↳ Narrow
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDP
↳ QDP
↳ QDPSizeChangeProof
Q DP problem:
The TRS P consists of the following rules:
new_delFromFM21(wvw121, wvw122, wvw123, wvw124, wvw125, wvw126, Zero, Zero, bb) → new_delFromFM22(wvw121, wvw122, wvw123, wvw124, wvw125, wvw126, bb)
new_delFromFM21(wvw121, wvw122, wvw123, wvw124, wvw125, wvw126, Succ(wvw1270), Zero, bb) → new_delFromFM(wvw125, Neg(Succ(wvw126)), bb)
new_delFromFM(Branch(Neg(Zero), wvw31, wvw32, wvw33, wvw34), Neg(Succ(wvw400)), ba) → new_delFromFM(wvw33, Neg(Succ(wvw400)), ba)
new_delFromFM21(wvw121, wvw122, wvw123, wvw124, wvw125, wvw126, Zero, Succ(wvw1280), bb) → new_delFromFM10(wvw121, wvw122, wvw123, wvw124, wvw125, wvw126, Succ(wvw121), Succ(wvw126), bb)
new_delFromFM(Branch(Pos(wvw300), wvw31, wvw32, wvw33, wvw34), Neg(Succ(wvw400)), ba) → new_delFromFM(wvw33, Neg(Succ(wvw400)), ba)
new_delFromFM22(wvw121, wvw122, wvw123, wvw124, wvw125, wvw126, bb) → new_delFromFM10(wvw121, wvw122, wvw123, wvw124, wvw125, wvw126, Succ(wvw121), Succ(wvw126), bb)
new_delFromFM10(wvw305, wvw306, wvw307, wvw308, wvw309, wvw310, Zero, Succ(wvw3120), bc) → new_delFromFM(wvw308, Neg(Succ(wvw310)), bc)
new_delFromFM(Branch(Neg(Succ(wvw3000)), wvw31, wvw32, wvw33, wvw34), Neg(Succ(wvw400)), ba) → new_delFromFM21(wvw3000, wvw31, wvw32, wvw33, wvw34, wvw400, wvw3000, wvw400, ba)
new_delFromFM10(wvw305, wvw306, wvw307, wvw308, wvw309, wvw310, Succ(wvw3110), Succ(wvw3120), bc) → new_delFromFM10(wvw305, wvw306, wvw307, wvw308, wvw309, wvw310, wvw3110, wvw3120, bc)
new_delFromFM21(wvw121, wvw122, wvw123, wvw124, wvw125, wvw126, Succ(wvw1270), Succ(wvw1280), bb) → new_delFromFM21(wvw121, wvw122, wvw123, wvw124, wvw125, wvw126, wvw1270, wvw1280, bb)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem. From the DPs we obtained the following set of size-change graphs:
- new_delFromFM10(wvw305, wvw306, wvw307, wvw308, wvw309, wvw310, Succ(wvw3110), Succ(wvw3120), bc) → new_delFromFM10(wvw305, wvw306, wvw307, wvw308, wvw309, wvw310, wvw3110, wvw3120, bc)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 > 7, 8 > 8, 9 >= 9
- new_delFromFM21(wvw121, wvw122, wvw123, wvw124, wvw125, wvw126, Zero, Zero, bb) → new_delFromFM22(wvw121, wvw122, wvw123, wvw124, wvw125, wvw126, bb)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 9 >= 7
- new_delFromFM10(wvw305, wvw306, wvw307, wvw308, wvw309, wvw310, Zero, Succ(wvw3120), bc) → new_delFromFM(wvw308, Neg(Succ(wvw310)), bc)
The graph contains the following edges 4 >= 1, 9 >= 3
- new_delFromFM(Branch(Neg(Succ(wvw3000)), wvw31, wvw32, wvw33, wvw34), Neg(Succ(wvw400)), ba) → new_delFromFM21(wvw3000, wvw31, wvw32, wvw33, wvw34, wvw400, wvw3000, wvw400, ba)
The graph contains the following edges 1 > 1, 1 > 2, 1 > 3, 1 > 4, 1 > 5, 2 > 6, 1 > 7, 2 > 8, 3 >= 9
- new_delFromFM21(wvw121, wvw122, wvw123, wvw124, wvw125, wvw126, Succ(wvw1270), Zero, bb) → new_delFromFM(wvw125, Neg(Succ(wvw126)), bb)
The graph contains the following edges 5 >= 1, 9 >= 3
- new_delFromFM21(wvw121, wvw122, wvw123, wvw124, wvw125, wvw126, Succ(wvw1270), Succ(wvw1280), bb) → new_delFromFM21(wvw121, wvw122, wvw123, wvw124, wvw125, wvw126, wvw1270, wvw1280, bb)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 > 7, 8 > 8, 9 >= 9
- new_delFromFM21(wvw121, wvw122, wvw123, wvw124, wvw125, wvw126, Zero, Succ(wvw1280), bb) → new_delFromFM10(wvw121, wvw122, wvw123, wvw124, wvw125, wvw126, Succ(wvw121), Succ(wvw126), bb)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 9 >= 9
- new_delFromFM22(wvw121, wvw122, wvw123, wvw124, wvw125, wvw126, bb) → new_delFromFM10(wvw121, wvw122, wvw123, wvw124, wvw125, wvw126, Succ(wvw121), Succ(wvw126), bb)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 >= 3, 4 >= 4, 5 >= 5, 6 >= 6, 7 >= 9
- new_delFromFM(Branch(Neg(Zero), wvw31, wvw32, wvw33, wvw34), Neg(Succ(wvw400)), ba) → new_delFromFM(wvw33, Neg(Succ(wvw400)), ba)
The graph contains the following edges 1 > 1, 2 >= 2, 3 >= 3
- new_delFromFM(Branch(Pos(wvw300), wvw31, wvw32, wvw33, wvw34), Neg(Succ(wvw400)), ba) → new_delFromFM(wvw33, Neg(Succ(wvw400)), ba)
The graph contains the following edges 1 > 1, 2 >= 2, 3 >= 3